paper-with-me

Papers

Sequential Linearithmic Time Optimal Unimodal Fitting When Minimizing Univariate Linear Losses

2023-04-04 · Kaan Gokcesu, Hakan Gokcesu

This paper focuses on optimal unimodal transformation of the score outputs of a univariate learning model under linear loss functions. We demonstrate that the optimal mapping between score values and the target region is a rectangular function. To produce this optimal rectangular fit for the observed samples, we propose a sequential approach that can its estimation with each incoming new sample. Our approach has logarithmic time complexity per iteration and is optimally efficient.

📄 PDF Abstract BibTeX arXiv:2304.02141

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

A Linearithmic Time Locally Optimal Algorithm for the Multiway Number Partition Optimization

2022-03-10 · Kaan Gokcesu, Hakan Gokcesu

We study the problem of multiway number partition optimization, which has a myriad of applications in the decision, learning and optimization literature. Even though the original multiway partitioning problem is NP-hard …

Unimodal Bandits without Smoothness

2014-06-28 · Richard Combes, Alexandre Proutiere

We consider stochastic bandit problems with a continuous set of arms and where the expected reward is a continuous and unimodal function of the arm. No further assumption is made regarding the smoothness and the structur…

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

2021-10-31 · Kaan Gokcesu, Hakan Gokcesu

We investigate the calibration of estimations to increase performance with an optimal monotone transform on the estimator outputs. We start by studying the traditional square error setting with its weighted variant and s…

regression

Linearithmic Clean-up for Vector-Symbolic Key-Value Memory with Kroneker Rotation Products

2025-06-18 · Ruipeng Liu, Qinru Qiu, Simon Khan, Garrett E. Katz

A computational bottleneck in current Vector-Symbolic Architectures (VSAs) is the ``clean-up'' step, which decodes the noisy vectors retrieved from the architecture. Clean-up typically compares noisy vectors against a ``…

UniForCE: The Unimodality Forest Method for Clustering and Estimation of the Number of Clusters

2023-12-18 · Georgios Vardakas, Argyris Kalogeratos, Aristidis Likas

Estimating the number of clusters k while clustering the data is a challenging task. An incorrect cluster assumption indicates that the number of clusters k gets wrongly estimated. Consequently, the model fitting becomes…

Clustering