Hakan Gökcesu

Orcid: 0000-0002-5113-0118

According to our database1, Hakan Gökcesu authored at least 47 papers between 2017 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Universal Online Convex Optimization With Minimax Optimal Second-Order Dynamic Regret.
IEEE Trans. Autom. Control., June, 2024

Cumulative Regret Analysis of the Piyavskii-Shubert Algorithm and Its Variants for Global Optimization.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
QoE Evaluation in Adaptive Streaming: Enhanced MDT with Deep Learning.
J. Netw. Syst. Manag., 2023

Sequential Linearithmic Time Optimal Unimodal Fitting When Minimizing Univariate Linear Losses.
CoRR, 2023

A Note On Nonlinear Regression Under L2 Loss.
CoRR, 2023

Efficient Lipschitzian Global Optimization of Hölder Continuous Multivariate Functions.
CoRR, 2023

Formulation of Weighted Average Smoothing as a Projection of the Origin onto a Convex Polytope.
CoRR, 2023

A 2-opt Algorithm for Locally Optimal Set Partition Optimization.
CoRR, 2023

Data Dependent Regret Guarantees Against General Comparators for Full or Bandit Feedback.
CoRR, 2023

Enhancing QoE Assessment in FWA: Leveraging Network KPIs and User Feedback Analysis.
Proceedings of the 28th IEEE International Workshop on Computer Aided Modeling and Design of Communication Links and Networks , 2023

2022
1D to nD: A Meta Algorithm for Multivariate Global Optimization via Univariate Optimizers.
CoRR, 2022

Optimal Tracking in Prediction with Expert Advice.
CoRR, 2022

An Auto-Regressive Formulation for Smoothing and Moving Mean with Exponentially Tapered Windows.
CoRR, 2022

Efficient Minimax Optimal Global Optimization of Lipschitz Continuous Multivariate Functions.
CoRR, 2022

A Log-Linear Time Sequential Optimal Calibration Algorithm for Quantized Isotonic L2 Regression.
CoRR, 2022

Robust, Nonparametric, Efficient Decomposition of Spectral Peaks under Distortion and Interference.
CoRR, 2022

Second Order Regret Bounds Against Generalized Expert Sequences under Partial Bandit Feedback.
CoRR, 2022

Blind Source Separation for Mixture of Sinusoids with Near-Linear Computational Complexity.
CoRR, 2022

Merging Knockout and Round-Robin Tournaments: A Flexible Linear Elimination Tournament Design.
CoRR, 2022

Natural Hierarchical Cluster Analysis by Nearest Neighbors with Near-Linear Time Complexity.
CoRR, 2022

A Linearithmic Time Locally Optimal Algorithm for the Multiway Number Partition Optimization.
CoRR, 2022

Smoothing with the Best Rectangle Window is Optimal for All Tapered Rectangle Windows.
CoRR, 2022

Nonconvex Extension of Generalized Huber Loss for Robust Learning and Pseudo-Mode Statistics.
CoRR, 2022

Low Regret Binary Sampling Method for Efficient Global Optimization of Univariate Functions.
CoRR, 2022

Deep Learning-Based QoE Prediction for Streaming Services in Mobile Networks.
Proceedings of the 18th International Conference on Wireless and Mobile Computing, 2022

2021
A Novel Method for Scheduling of Wireless Ad Hoc Networks in Polynomial Time.
IEEE Trans. Wirel. Commun., 2021

Graph-Theoretical Dynamic User Pairing for Downlink NOMA Systems.
IEEE Commun. Lett., 2021

Efficient, Anytime Algorithms for Calibration with Isotonic Regression under Strictly Convex Losses.
CoRR, 2021

Near-Linear Time Algorithm with Near-Logarithmic Regret Per Switch for Mixable/Exp-Concave Losses.
CoRR, 2021

Generalized Translation and Scale Invariant Online Algorithm for Adversarial Multi-Armed Bandits.
CoRR, 2021

A Quadratic Time Locally Optimal Algorithm for NP-hard Equal Cardinality Partition Optimization.
CoRR, 2021

Efficient Locally Optimal Number Set Partitioning for Scheduling, Allocation and Fair Selection.
CoRR, 2021

Nonparametric Extrema Analysis in Time Series for Envelope Extraction, Peak Detection and Clustering.
CoRR, 2021

Generalized Huber Loss for Robust Learning and its Efficient Minimization for a Robust Statistics.
CoRR, 2021

Regret Analysis of Global Optimization in Univariate Functions with Lipschitz Derivatives.
CoRR, 2021

Optimally Efficient Sequential Calibration of Binary Classifiers to Minimize Classification Error.
CoRR, 2021

Optimal and Efficient Algorithms for General Mixable Losses against Switching Oracles.
CoRR, 2021

Virtual Drive-Tests: A Case for Predicting QoE in Adaptive Video Streaming.
CoRR, 2021

2020
Recursive Experts: An Efficient Optimal Mixture of Learning Systems in Dynamic Environments.
CoRR, 2020

A Generalized Online Algorithm for Translation and Scale Invariant Prediction with Expert Advice.
CoRR, 2020

2019
Minimax Optimal Algorithms for Adversarial Bandit Problem With Multiple Plays.
IEEE Trans. Signal Process., 2019

Sequential Outlier Detection Based on Incremental Decision Trees.
IEEE Trans. Signal Process., 2019

Asymptotically Optimal Contextual Bandit Algorithm Using Hierarchical Structures.
IEEE Trans. Neural Networks Learn. Syst., 2019

Efficient Online Convex Optimization with Adaptively Minimax Optimal Dynamic Regret.
CoRR, 2019

Minimax Optimal Online Stochastic Learning for Sequences of Convex Functions under Sub-Gradient Observation Failures.
CoRR, 2019

2017
Nearly Optimal Scheduling of Wireless Ad Hoc Networks in Polynomial Time.
CoRR, 2017

An Asymptotically Optimal Algorithm for Communicating Multiplayer Multi-Armed Bandit Problems.
CoRR, 2017


  Loading...