English
Related papers

Related papers: Some new maximum VC classes

200 papers

Positive definite functions are fundamental to many areas of applied mathematics, probability theory, spatial statistics and machine learning, amogst others. Motivated by a problem coming from the maximum likelihood estimation under fixed…

Spectral Theory · Mathematics 2019-10-10 T. Faouzi , E. Porcu , M. Bevilacqua , I. Kondrashuk

The study of strategic or adversarial manipulation of testing data to fool a classifier has attracted much recent attention. Most previous works have focused on two extreme situations where any testing data point either is completely…

Machine Learning · Computer Science 2021-06-14 Ravi Sundaram , Anil Vullikanti , Haifeng Xu , Fan Yao

We develop a denotational semantics of muLL, a version of propositional Linear Logic with least and greatest fixed points extending David Baelde's propositional muMALL with exponentials. Our general categorical setting is based on the…

Logic in Computer Science · Computer Science 2021-05-20 Thomas Ehrhard , Farzad Jafarrahmani

The effectiveness of Symmetric Positive Definite (SPD) manifold features has been proven in various computer vision tasks. However, due to the non-Euclidean geometry of these features, existing Euclidean machineries cannot be directly used.…

Computer Vision and Pattern Recognition · Computer Science 2019-05-30 Kun Zhao , Arnold Wiliem , Shaokang Chen , Brian C. Lovell

Multi-distribution learning is a natural generalization of PAC learning to settings with multiple data distributions. There remains a significant gap between the known upper and lower bounds for PAC-learnable classes. In particular, though…

Machine Learning · Computer Science 2023-07-25 Pranjal Awasthi , Nika Haghtalab , Eric Zhao

The classical PAC sample complexity bounds are stated for any Empirical Risk Minimizer (ERM) and contain an extra logarithmic factor $\log(1/{\epsilon})$ which is known to be necessary for ERM in general. It has been recently shown by…

Machine Learning · Computer Science 2020-05-26 Olivier Bousquet , Steve Hanneke , Shay Moran , Nikita Zhivotovskiy

The Vapnik-Chervonenkis dimension is a combinatorial parameter that reflects the "complexity" of a set of sets (a.k.a. concept classes). It has been introduced by Vapnik and Chervonenkis in their seminal 1971 paper and has since found many…

Machine Learning · Computer Science 2015-07-21 Shai Ben-David

This paper is concerned with existence and qualitative properties of positive solutions of semilinear elliptic equations in bounded domains with Dirichlet boundary conditions. We show the existence of positive solutions in the vicinity of…

Analysis of PDEs · Mathematics 2025-11-26 François Hamel , Nikolai Nadirashvili

High dimensional central limit theorems (the CLTs) have been extensively studied in recent years under a variety of sufficient moment conditions connecting the dimension growth rate with the tail decay rate. In this article, we investigate…

Probability · Mathematics 2025-12-30 Debraj Das , Soumendra Lahiri

This work proposes a new type of classifier called Morphological Classifier (MC). MCs aggregate concepts from mathematical morphology and supervised learning. The outcomes of this aggregation are classifiers that may preserve shape…

Machine Learning · Computer Science 2021-12-24 É. O. Rodrigues , A. Conci , P. Liatsis

In this work, we consider classification of agents who can both game and improve. For example, people wishing to get a loan may be able to take some actions that increase their perceived credit-worthiness and others that also increase their…

Computer Science and Game Theory · Computer Science 2022-03-02 Saba Ahmadi , Hedyeh Beyhaghi , Avrim Blum , Keziah Naggita

We define a new class of positive and Lebesgue measurable functions in terms of their asymptotic behavior, which includes the class of regularly varying functions. We also characterize it by transformations, corresponding to generalized…

Probability · Mathematics 2014-12-02 Meitner Cadena , Marie Kratz

While the optimal sample complexity of binary classification in terms of the VC dimension is well-established, determining the optimal sample complexity of multiclass classification has remained open. The appropriate complexity parameter…

Machine Learning · Computer Science 2026-04-28 Chirag Pabbaraju

In this paper, we study a bi-criterion framework for assessing scoring functions in the context of binary classification. The positive and negative predictive values (ppv and npv, respectively) are conditional probabilities of the true…

Machine Learning · Statistics 2020-07-13 Keshav Vemuri , Nathan Srebro

This manuscript studies statistical properties of linear classifiers obtained through minimization of an unregularized convex risk over a finite sample. Although the results are explicitly finite-dimensional, inputs may be passed through…

Machine Learning · Computer Science 2012-06-15 Matus Telgarsky

In this paper the necessary conditions of optimality in the form of maximum principle are derived for a very general class of variational problems. This class includes problems with any optimization criteria and constraints that can be…

Optimization and Control · Mathematics 2009-11-30 Anatoly Tsirlin

The concept of convex compactness, weaker than the classical notion of compactness, is introduced and discussed. It is shown that a large class of convex subsets of topological vector spaces shares this property and that is can be used in…

Functional Analysis · Mathematics 2010-06-02 Gordan Zitkovic

Consider a measurable space with an atomless finite vector measure. This measure defines a mapping of the $\sigma$-field into an Euclidean space. According to the Lyapunov convexity theorem, the range of this mapping is a convex compactum.…

Probability · Mathematics 2011-02-14 Peng Dai , Eugene A. Feinberg

We introduce a theory of relative tangency for projective algebraic varieties. The dual variety $X_Z^\vee$ of a variety $X$ relative to a subvariety $Z$ is the set of hyperplanes tangent to $X$ at a point of $Z$. We also introduce the…

Algebraic Geometry · Mathematics 2025-12-02 Sandra Di Rocco , Lukas Gustafsson , Luca Sodomaco

A continuous equivariant map from the Floyd boundary of a relatively hyperbolic group (RHG for short) to its Bowditch boundary is constructed. Such a map is unique unless the group is two-ended. In order to optimize the proof and the usage…

Group Theory · Mathematics 2012-04-27 Victor Gerasimov