ArXivCSExplorer
β˜†β˜†BookmarksπŸ†RSSHow to UseFAQ
Built with and by Teycir Ben Soltaneβ€’
How to Useβ€’FAQβ€’GitHubβ€’arXiv.orgβ€’
Share:

20 results for β€œClass probabilities”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.β“˜

Want pure semantic search? Try claim verification β†’

math.STcs.LGmath.PREmpiricalRecentJun 4, 2026

How abundant are good interpolators?

August Y. Chen, Ahmed El Alaoui

This paper establishes a large deviation principle for the generalization error of interpolating classifiers in the overparametrized regime.

View β†’
cs.DSTheoreticalRecentSep 18, 2026

The Complexity of Computing Class Probabilities in BID Probabilistic Databases

Sotiris Kanellopoulos, Ioannis Koutras, Aris Pagourtzis

Computes class probabilities in block-independent disjoint probabilistic databases.

View β†’
cs.LGcs.AIRecentMay 30, 2026

Demystifying the Optimal Fair Classifier in Multi-Class Classification

Li Zhang, Yuyuan Li, XiaoHua Feng, Jiaming Zhang +2 more

This paper addresses the challenge of achieving optimal fairness and accuracy simultaneously in multi-class classification by proposing novel in-processing and post-processing algorithms that converge…

View β†’
stat.MLcs.LGmath.STTheoreticalRecentJun 11, 2026

Majority-of-Three is Optimal

Divit Rawal, Nikita Zhivotovskiy

The paper proves that the majority vote of three independent consistent classifiers is an optimal learner in the realizable PAC setting.

View β†’
stat.MLcs.LGmath.STTheoreticalRecentJun 26, 2026

Surprises in Proper Positive-Only Learning

Shai Ben-David, Farnam Mansouri, Anay Mehrotra, Manolis Zampetakis

This paper characterizes proper binary classification from positive-only samples, revealing a rich landscape that differs from standard PAC learning.

View β†’
cs.DSmath.PRTheoreticalRecentJul 24, 2026

HyperLogLog for probabilists

Lucas Gerin

This paper provides non-asymptotic and explicit estimates for the exponential deviation inequalities of the HyperLogLog estimator.

View β†’
cs.LGcs.AIRecentMay 29, 2026

From Rashomon Theory to PRAXIS: Efficient Decision Tree Rashomon Sets

Zakk Heile, Hayden McTavish, Varun Babbar, Margo Seltzer +1 more

The paper introduces PRAXIS, a novel algorithm that efficiently approximates the computation of 'Rashomon sets' for decision trees, significantly reducing memory and runtime complexity.

View β†’
cs.CCTheoreticalRecentJul 31, 2026

On the Complexity of Computing Outputs of a Metric Turing Machine

Yaroslav Ivanashev

This paper introduces classes of functions that compute the k-th solution for certain types of problems and proves their inter-reducibility with corresponding classes for different order functions. It…

View β†’
cs.DScs.AIcs.LGTheoreticalRecentJun 9, 2026

The Power of Test-Time Training for Approximate Sampling

Noah Golowich, Ankur Moitra, Dhruv Rohatgi

This paper formalizes test-time training (TTT) as a problem of sampling from a given probability measure and shows a quadratic lower bound on the query complexity of sampling.

View β†’
cs.SEcs.AIcs.PLEmpiricalRecentOct 27, 2026

ProCerDCL: Query-Efficient Black-Box Probabilistic Verification of Deep Learning Compiler Optimization

Zexin Li, Weibo Zhang, Linyi Li, Arvind Easwaran +1 more

A query-efficient framework for black-box probabilistic verification.

View β†’
cs.ITcs.AImath.PRTheoreticalRecentAug 1, 2026

An Information Theoretic Treatment of Yager's Probability Distribution Negation

Roberto Bruno, Ugo Vaccaro

This paper provides an information-theoretic analysis of Yager's negation of probability distributions and its generalizations.

View β†’
cs.DScs.LGmath.STTheoreticalRecentJun 9, 2026

Density estimation for Hellinger via minimum-distance estimators: mixtures of Gaussians, log-concave, and more

Spencer Compton, Jerry Li

The paper extends the minimum-distance estimator approach for density estimation from total variation distance to Hellinger distance.

View β†’
stat.MLcs.LGEmpiricalRecentJun 28, 2026

Gradient boosting with vector-valued leafs

David Cortes

This paper extends gradient boosting to functions of vector inputs using a simple algorithm with histogram-based decision trees.

View β†’
cs.CCTheoreticalRecentNov 11, 2026

The Ultimate Karp-Lipton Collapse

Edward A. Hirsch, Ilya Volkovich

The authors prove a new collapse in the polynomial hierarchy and introduce a new class of languages.

View β†’
stat.MLcs.CCcs.DSTheoreticalRecentJul 7, 2026

Boosting with List-Decodable Codes

Addison Prairie, Li-Yang Tan

A new boosting algorithm that strong learns concept classes closed under O(log 1/Ξ³)-XOR using O(log 1/Ξ΅) calls to a Ξ³-advantage weak learner and additional samples, by connecting boosting with list-de…

View β†’