paper-with-me

Papers

Generalization via Derandomization

2020-01-01 · ICML 2020 1 · Jeffrey Negrea, Daniel Roy, Gintare Karolina Dziugaite

We propose to study the generalization error of a learned predictor h^ in terms of that of a surrogate (potentially randomized) classifier that is coupled to h^ and designed to trade empirical risk for control of generalization error. In the case where h^ interpolates the data, it is interesting to consider theoretical surrogate classifiers that are partially derandomized or rerandomized, e.g., fit to the training data but with modified label noise. We show that replacing h^ by its conditional distribution with respect to an arbitrary sigma-field is a viable method to derandomize. We give an example, inspired by the work of Nagarajan and Kolter (2019), where the learned classifier h^ interpolates the training data with high probability, has small risk, and, yet, does not belong to a nonrandom class with a tight uniform bound on two-sided generalization error. At the same time, we bound the risk of h^ in terms of a surrogate that is constructed by conditioning and shown to belong to a nonrandom class with uniformly small generalization error.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Metric-Fair Classifier Derandomization

2022-06-15 · Jimmy Wu, Yatong Chen, Yang Liu

We study the problem of classifier derandomization in machine learning: given a stochastic binary classifier $f: X \to [0,1]$, sample a deterministic classifier $\hat{f}: X \to \{0,1\}$ that approximates the output of $f…

Fairness

Smoothness-Based Derandomization of PAC-Bayes Bounds

2026-06-17 · Alexandre Lemire Paquin, Brahim Chaib-Draa, Philippe Giguère arxiv

We study PAC-Bayes derandomization for smooth loss functions. Our goal is to obtain generalization bounds that hold with high probability for deterministic predictors by exploiting smoothness properties of both the loss …

Tackling Prevalent Conditions in Unsupervised Combinatorial Optimization: Cardinality, Minimum, Covering, and More

2024-05-14 · Fanchen Bu, Hyeonsoo Jo, Soo Yong Lee, Sungsoo Ahn 외

Combinatorial optimization (CO) is naturally discrete, making machine learning based on differentiable optimization inapplicable. Karalias & Loukas (2020) adapted the probabilistic method to incorporate CO into different…

Combinatorial Optimization

On Training-Test (Mis)alignment in Unsupervised Combinatorial Optimization: Observation, Empirical Exploration, and Analysis

2025-06-20 · Fanchen Bu, Kijung Shin

In unsupervised combinatorial optimization (UCO), during training, one aims to have continuous decisions that are promising in a probabilistic sense for each training instance, which enables end-to-end training on initia…

Combinatorial Optimization

A General Framework for the Practical Disintegration of PAC-Bayesian Bounds

2021-02-17 · Paul Viallard, Pascal Germain, Amaury Habrard, Emilie Morvant

PAC-Bayesian bounds are known to be tight and informative when studying the generalization ability of randomized classifiers. However, they require a loose and costly derandomization step when applied to some families of…

Generalization Bounds