default search action
Kaan Gökcesu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c5]Kaan Gökcesu, Hakan Gökcesu:
Cumulative Regret Analysis of the Piyavskii-Shubert Algorithm and Its Variants for Global Optimization. AAAI 2024: 20700-20708 - 2023
- [i34]Kaan Gökcesu, Hakan Gökcesu:
Data Dependent Regret Guarantees Against General Comparators for Full or Bandit Feedback. CoRR abs/2303.06526 (2023) - [i33]Kaan Gökcesu, Hakan Gökcesu:
A 2-opt Algorithm for Locally Optimal Set Partition Optimization. CoRR abs/2303.08219 (2023) - [i32]Kaan Gökcesu, Hakan Gökcesu:
Formulation of Weighted Average Smoothing as a Projection of the Origin onto a Convex Polytope. CoRR abs/2303.11958 (2023) - [i31]Kaan Gökcesu, Hakan Gökcesu:
Efficient Lipschitzian Global Optimization of Hölder Continuous Multivariate Functions. CoRR abs/2303.14293 (2023) - [i30]Kaan Gökcesu, Hakan Gökcesu:
A Note On Nonlinear Regression Under L2 Loss. CoRR abs/2303.17745 (2023) - [i29]Kaan Gökcesu, Hakan Gökcesu:
Sequential Linearithmic Time Optimal Unimodal Fitting When Minimizing Univariate Linear Losses. CoRR abs/2304.02141 (2023) - 2022
- [i28]Kaan Gökcesu, Hakan Gökcesu:
Low Regret Binary Sampling Method for Efficient Global Optimization of Univariate Functions. CoRR abs/2201.07164 (2022) - [i27]Kaan Gökcesu, Hakan Gökcesu:
Nonconvex Extension of Generalized Huber Loss for Robust Learning and Pseudo-Mode Statistics. CoRR abs/2202.11141 (2022) - [i26]Kaan Gökcesu, Hakan Gökcesu:
Smoothing with the Best Rectangle Window is Optimal for All Tapered Rectangle Windows. CoRR abs/2203.02997 (2022) - [i25]Kaan Gökcesu, Hakan Gökcesu:
A Linearithmic Time Locally Optimal Algorithm for the Multiway Number Partition Optimization. CoRR abs/2203.05618 (2022) - [i24]Kaan Gökcesu, Hakan Gökcesu:
Natural Hierarchical Cluster Analysis by Nearest Neighbors with Near-Linear Time Complexity. CoRR abs/2203.08027 (2022) - [i23]Kaan Gökcesu, Hakan Gökcesu:
Merging Knockout and Round-Robin Tournaments: A Flexible Linear Elimination Tournament Design. CoRR abs/2203.12011 (2022) - [i22]Kaan Gökcesu, Hakan Gökcesu:
Blind Source Separation for Mixture of Sinusoids with Near-Linear Computational Complexity. CoRR abs/2203.14324 (2022) - [i21]Kaan Gökcesu, Hakan Gökcesu:
Second Order Regret Bounds Against Generalized Expert Sequences under Partial Bandit Feedback. CoRR abs/2204.06660 (2022) - [i20]Kaan Gökcesu, Hakan Gökcesu:
Robust, Nonparametric, Efficient Decomposition of Spectral Peaks under Distortion and Interference. CoRR abs/2204.08411 (2022) - [i19]Kaan Gökcesu, Hakan Gökcesu:
A Log-Linear Time Sequential Optimal Calibration Algorithm for Quantized Isotonic L2 Regression. CoRR abs/2206.00744 (2022) - [i18]Kaan Gökcesu, Hakan Gökcesu:
Efficient Minimax Optimal Global Optimization of Lipschitz Continuous Multivariate Functions. CoRR abs/2206.02383 (2022) - [i17]Kaan Gökcesu, Hakan Gökcesu:
An Auto-Regressive Formulation for Smoothing and Moving Mean with Exponentially Tapered Windows. CoRR abs/2206.14749 (2022) - [i16]Kaan Gökcesu, Hakan Gökcesu:
1D to nD: A Meta Algorithm for Multivariate Global Optimization via Univariate Optimizers. CoRR abs/2209.03246 (2022) - 2021
- [j10]Alper Köse
, Hakan Gökcesu
A Novel Method for Scheduling of Wireless Ad Hoc Networks in Polynomial Time. IEEE Trans. Wirel. Commun. 20(1): 468-480 (2021) - [i15]Kaan Gökcesu, Hakan Gökcesu:
Optimal and Efficient Algorithms for General Mixable Losses against Switching Oracles. CoRR abs/2108.06411 (2021) - [i14]Kaan Gökcesu, Hakan Gökcesu:
Optimally Efficient Sequential Calibration of Binary Classifiers to Minimize Classification Error. CoRR abs/2108.08780 (2021) - [i13]Kaan Gökcesu, Hakan Gökcesu:
Regret Analysis of Global Optimization in Univariate Functions with Lipschitz Derivatives. CoRR abs/2108.10859 (2021) - [i12]Kaan Gökcesu, Hakan Gökcesu:
Generalized Huber Loss for Robust Learning and its Efficient Minimization for a Robust Statistics. CoRR abs/2108.12627 (2021) - [i11]Kaan Gökcesu, Hakan Gökcesu:
Nonparametric Extrema Analysis in Time Series for Envelope Extraction, Peak Detection and Clustering. CoRR abs/2109.02082 (2021) - [i10]Kaan Gökcesu, Hakan Gökcesu:
Efficient Locally Optimal Number Set Partitioning for Scheduling, Allocation and Fair Selection. CoRR abs/2109.04809 (2021) - [i9]Kaan Gökcesu, Hakan Gökcesu:
A Quadratic Time Locally Optimal Algorithm for NP-hard Equal Cardinality Partition Optimization. CoRR abs/2109.07882 (2021) - [i8]Kaan Gökcesu, Hakan Gökcesu:
Generalized Translation and Scale Invariant Online Algorithm for Adversarial Multi-Armed Bandits. CoRR abs/2109.09212 (2021) - [i7]Kaan Gökcesu, Hakan Gökcesu:
Near-Linear Time Algorithm with Near-Logarithmic Regret Per Switch for Mixable/Exp-Concave Losses. CoRR abs/2109.13786 (2021) - [i6]Kaan Gökcesu, Hakan Gökcesu:
Efficient, Anytime Algorithms for Calibration with Isotonic Regression under Strictly Convex Losses. CoRR abs/2111.00468 (2021) - 2020
- [i5]Kaan Gökcesu, Hakan Gökcesu:
A Generalized Online Algorithm for Translation and Scale Invariant Prediction with Expert Advice. CoRR abs/2009.04372 (2020) - [i4]Kaan Gökcesu, Hakan Gökcesu:
Recursive Experts: An Efficient Optimal Mixture of Learning Systems in Dynamic Environments. CoRR abs/2009.09249 (2020)
2010 – 2019
- 2019
- [j9]Mohammadreza Mohaghegh Neyshabouri
Asymptotically Optimal Contextual Bandit Algorithm Using Hierarchical Structures. IEEE Trans. Neural Networks Learn. Syst. 30(3): 923-937 (2019) - [j8]Kaan Gökcesu
Sequential Outlier Detection Based on Incremental Decision Trees. IEEE Trans. Signal Process. 67(4): 993-1005 (2019) - [j7]Nuri Mert Vural
Minimax Optimal Algorithms for Adversarial Bandit Problem With Multiple Plays. IEEE Trans. Signal Process. 67(16): 4383-4398 (2019) - [i3]Nuri Mert Vural, Hakan Gökcesu, Kaan Gökcesu, Suleyman Serdar Kozat:
Minimax Optimal Algorithms for Adversarial Bandit Problem with Multiple Plays. CoRR abs/1911.11122 (2019) - 2018
- [j6]Mert Ergeneci
An Embedded, Eight Channel, Noise Canceling, Wireless, Wearable sEMG Data Acquisition System With Adaptive Muscle Contraction Detection. IEEE Trans. Biomed. Circuits Syst. 12(1): 68-79 (2018) - [j5]Kaan Gökcesu
Online Density Estimation of Nonstationary Sources Using Exponential Family of Distributions. IEEE Trans. Neural Networks Learn. Syst. 29(9): 4473-4478 (2018) - [j4]Kaan Gökcesu
An Online Minimax Optimal Algorithm for Adversarial Multiarmed Bandit Problem. IEEE Trans. Neural Networks Learn. Syst. 29(11): 5565-5580 (2018) - [j3]Kaan Gökcesu
Online Anomaly Detection With Minimax Optimal Density Estimation in Nonstationary Environments. IEEE Trans. Signal Process. 66(5): 1213-1227 (2018) - [c4]Kaan Gökcesu, Mert Ergeneci, Erhan Ertan, Abdallah Zaid Alkilani, Panagiotis Kosmas
An sEMG-based method to adaptively reject the effect of contraction on spectral analysis for fatigue tracking. UbiComp 2018: 80-87 - 2017
- [c3]Tolga Ergen, Kaan Gökcesu, Mustafa Simsek, Suleyman Serdar Kozat:
Novelty detection using soft partitioning and hierarchical models. SIU 2017: 1-4 - [c2]Kaan Gökcesu, Tolga Ergen, Selami Çiftçi, Suleyman Serdar Kozat:
An efficient bandit algorithm for general weight assignments. SIU 2017: 1-4 - [c1]Kaan Gökcesu, Eren Manis, Ali Emirhan Kurt, Ersin Yar:
Estimating distributions varying in time in a universal manner. SIU 2017: 1-4 - [i2]Alper Köse, Noyan Evirgen, Hakan Gökcesu, Kaan Gökcesu, Muriel Médard:
Nearly Optimal Scheduling of Wireless Ad Hoc Networks in Polynomial Time. CoRR abs/1712.00658 (2017) - 2016
- [j2]Ibrahim Delibalta
Online Anomaly Detection With Nested Trees. IEEE Signal Process. Lett. 23(12): 1867-1871 (2016) - [j1]N. Denizcan Vanli, Kaan Gökcesu, Muhammed O. Sayin
Sequential Prediction Over Hierarchical Structures. IEEE Trans. Signal Process. 64(23): 6284-6298 (2016) - [i1]Mohammadreza Mohaghegh Neyshabouri, Kaan Gökcesu, Selami Ciftci, Suleyman Serdar Kozat:
A Nearly Optimal Contextual Bandit Algorithm. CoRR abs/1612.01367 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: