Fetching the paper…
Reading the bibliography…
A compression function is a map that slims down an observational set into a subset of reduced size, while preserving its informational content.
Theory of Pattern Recognition
V. Vapnik and A. Chervonenkis · 1974
Earlier work this paper cites.
Principle of Mathematical Analysis
W. Rudin · 1976
Earlier work this paper cites.
Relating data compression and learnability
N. Littlestone and M. Warmuth · 1986
Earlier work this paper cites.
Bounds for the difference between median and mean of beta and negative binomial distributions
M.E. Payton, L.J. Young, and J.H. Young · 1989
Earlier work this paper cites.
Learning nested differences of intersection-closed concept classes
D. Helmbold, R. Sloan, and M.K. Warmuth · 1990
Earlier work this paper cites.
Functional Analysis
W. Rudin · 1991
Earlier work this paper cites.
Probability and Measure
P. Billingsley · 1995
Earlier work this paper cites.
Support vector networks
C. Cortes and V. Vapnik · 1995
Earlier work this paper cites.
Sample compression, learnability, and the Vapnik-Chervonenkis dimension
S. Floyd and M. Warmuth · 1995
Earlier work this paper cites.
Probability
A.N. Shiryaev · 1996
Earlier work this paper cites.
Learning with kernels
B. Schölkopf and A.J. Smola · 1998
Earlier work this paper cites.
Shrinking the tube: A new support vector regression algorithm
B. Schölkopf, P. Bartlett, A. Smola, and R. Williamson · 1998
Earlier work this paper cites.
Neural Network Learning: Theoretical Foundations
M. Anthony and P.L. Bartlett · 1999
Earlier work this paper cites.
Uniqueness of the SVM solution
C.J.C. Burges and D.J. Crisp · 1999
Earlier work this paper cites.
Support vector method for novelty detection
B. Schölkopf, R. Williamson, A. Smola, J. Shawe-Taylor, and J. Plattt · 1999
Earlier work this paper cites.
A tutorial on support vector regression
A.J. Smola and B. Schölkopf · 2004
Earlier work this paper cites.
Support vector data description
D.M.J. Tax and R.P.W. Duin · 2004
Earlier work this paper cites.
Uncertain convex programs: randomized solutions and confidence levels
G.C. Calafiore and M.C. Campi · 2005
Earlier work this paper cites.
PAC-Bayesian compression bounds on the prediction error of learning algorithms for classification
T. Graepel, R. Herbrich, and J.Shawe-Taylor · 2005
Earlier work this paper cites.
The scenario approach to robust control design
G.C. Calafiore and M.C. Campi · 2006
Earlier work this paper cites.
The exact feasibility of randomized solutions of uncertain convex programs
M.C. Campi and S. Garatti · 2008
Earlier work this paper cites.
A scenario based approach to robust experiment design
J.S. Welsh and C.R. Rojas · 2009
Cited alongside, same era.
Classification with guaranteed probability of error
M.C. Campi · 2010
Cited alongside, same era.
A sampling-and-discarding approach to chance-constrained optimization: feasibility and optimality
M.C. Campi and S. Garatti · 2011
Cited alongside, same era.
Theoretical analysis for solution of support vector data description
X. Wang, F. Chung, and S. Wang · 2011
Cited alongside, same era.
Robust experiment design through randomisation with chance constraints
J.S. Welsh and H. Kong · 2011
Cited alongside, same era.
Risk-return trade-off with the scenario approach in practice: A case study in portfolio selection
B.K. Pagnoncelli, D. Reich, and M.C. Campi · 2012
Nearest-neighbor sample compression: Efficiency, consistency, infinite dimensions
A. Kontorovich, S. Sabato, and R. Weiss · 2017
Later among the works it cites.
Interval predictor models for data with measurement uncertainty
M.J. Lacerda and L. G. Crespo · 2017
Later among the works it cites.
Wait-and-judge scenario optimization
M.C. Campi and S. Garatti · 2018
Later among the works it cites.
A general scenario theory for nonconvex optimization and decision making
M.C. Campi, S. Garatti, and F.A. Ramponi · 2018
Later among the works it cites.
A new classification algorithm with guaranteed sensitivity and specificity for medical applications
A. Caré, F.A. Ramponi, and M.C. Campi · 2018
Later among the works it cites.
Active nearest-neighbor learning in metric spaces
A. Kontorovich, S. Sabato, and R. Urner · 2018
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Random convex programs with L 1 {L}_{1} -regularization: sparsity and generalization
M.C. Campi and A. Carè · 2013
Cited alongside, same era.
Randomized solutions to convex programs with multiple chance constraints
G. Schildbach, L. Fagiano, and M. Morari · 2013
Cited alongside, same era.
On the road between robust optimization and the scenario approach for chance constrained optimization problems
K. Margellos, P.J. Goulart, and J. Lygeros · 2014
Cited alongside, same era.
The scenario approach for stochastic model predictive control with bounds on closed-loop constraint violations
G. Schildbach, L. Fagiano, C. Frei, and M. Morari · 2014
Cited alongside, same era.
Underwstanding Machine Learning (from theory to algorithms)
S. Shalev-Shwartz and S. Ben-David · 2014
Cited alongside, same era.
Randomized methods for design of uncertain systems: sample complexity and sequential algorithms
T. Alamo, R. Tempo, A. Luque, and D. R. Ramirez · 2015
Cited alongside, same era.
Later among the works it cites.
Distributed constrained optimization and consensus in uncertain networks via proximal minimization
K. Margellos, A. Falsone, S. Garatti, and M. Prandini · 2018
Later among the works it cites.
On the quantification of aleatory and epistemic uncertainty using sliced-normal distributions
L.G. Crespo, B.K. Colbert, S.P. Kenny, and D.P. Giesy · 2019
Later among the works it cites.
Optimal disturbance compensation for constrained linear systems operating in stationary conditions: A scenario-based approach
A. Falsone, L. Deori, D. Ioli, S. Garatti, and M. Prandini · 2019
Later among the works it cites.
On a class of interval predictor models with universal reliability
S. Garatti, M.C. Campi, and A. Caré · 2019
Later among the works it cites.
A sharp lower bound for agnostic learning with sample compression schemes
S. Hanneke and A. Kontorovich · 2019
Later among the works it cites.
Proper learning, Helly number, and an optimal SVM bound
O. Bousquet, S. Hanneke, S. Moran, and N. Zhivotovskiy · 2020
Later among the works it cites.
A theory of the risk for optimization with relaxation and its application to support vector machines
M.C. Campi and S. Garatti · 2021
Later among the works it cites.
The scenario approach: a tool at the service of data-driven decision making
M.C. Campi, A. Carè, and S. Garatti · 2021
Later among the works it cites.
Stable sample compression schemes: new applications and an optimal SVM margin bound
S. Hanneke and A. Kontorovich · 2021
Later among the works it cites.
Universal Bayes consistency in metric spaces
S. Hanneke, A. Kontorovich, S. Sabato, and R. Weiss · 2021
Later among the works it cites.
Risk and complexity in scenario optimization
S. Garatti and M.C. Campi · 2022
Later among the works it cites.
On conditional risk assessments in scenario optimization
S. Garatti and M.C. Campi · 2023
Closest in time.
Complexity is an effective observable to tune early stopping in scenario optimization
S. Garatti, M.C. Campi, and A. Caré · 2023
Closest in time.
The Pick-to-Learn algorithm: Empowering compression for tight generalization bounds and improved post-training performance
D. Paccagnan, M.C. Campi, and S. Garatti · 2023
Closest in time.