Exact Convex Confidence-Weighted Learning

2008-12-01 · NeurIPS 2008 12 · Koby Crammer, Mark Dredze, Fernando Pereira

Confidence-weighted (CW) learning [6], an online learning method for linear classifiers, maintains a Gaussian distributions over weight vectors, with a covariance matrix that represents uncertainty about weights and correlations. Confidence constraints ensure that a weight vector drawn from the hypothesis distribution correctly classifies examples with a specified probability. Within this framework, we derive a new convex form of the constraint and analyze it in the mistake bound model. Empirical evaluation with both synthetic and text data shows our version of CW learning achieves lower cumulative and out-of-sample errors than commonly used first-order and second-order online methods.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Optimally Weighted Ensembles of Regression Models: Exact Weight Optimization and Applications

2022-06-22 · Patrick Echtenbruck, Martina Echtenbruck, Joost Batenburg, Thomas Bäck 외

Automated model selection is often proposed to users to choose which machine learning model (or method) to apply to a given regression task. In this paper, we show that combining different regression models can yield bet…

Drug Discovery Model Selection regression

An Inexact Weighted Proximal Trust-Region Method

2026-01-13 · Leandro Farias Maia, Robert Baraldi, Drew P. Kouri arxiv

In [R. J. Baraldi and D. P. Kouri, Math. Program., 201:1 (2023), pp. 559-598], the authors introduced a trust-region method for minimizing the sum of a smooth nonconvex and a nonsmooth convex function, the latter of whic…

Weighted total variation based convex clustering

2018-08-28 · Guodong Xu, Yu Xia, Hui Ji

Data clustering is a fundamental problem with a wide range of applications. Standard methods, eg the $k$-means method, usually require solving a non-convex optimization problem. Recently, total variation based convex rel…

Clustering

Stopping Rules for Stochastic Gradient Descent via Anytime-Valid Confidence Sequences

2025-12-15 · Liviu Aolaritei, Michael I. Jordan arxiv

The problem of stopping stochastic gradient descent (SGD) in an online manner, based solely on the observed trajectory, is a challenging theoretical problem with significant consequences for applications. While SGD is ro…

Sign-Perturbed Sums: A New System Identification Approach for Constructing Exact Non-Asymptotic Confidence Regions in Linear Regression Models

2018-07-22 · Balázs Cs. Csáji, Marco C. Campi, Erik Weyer

We propose a new system identification method, called Sign-Perturbed Sums (SPS), for constructing non-asymptotic confidence regions under mild statistical assumptions. SPS is introduced for linear regression models, incl…