On the public citation graph
On Learning Sets and Functions
0 signed · 185 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-319-21852-6_3openalex-snapshot
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
inferredcites →https://doi.org/10.1007/bf00116250openalex-snapshot
Explanation-based generalization: A unifying view
inferredcites →https://doi.org/10.1016/0890-5401(87)90052-6openalex-snapshot
Learning regular sets from queries and counterexamples
inferredcites →https://doi.org/10.1016/b978-0-934613-41-5.50037-4openalex-snapshot
Recent Results on Boolean Concept Learning
inferredcites →https://doi.org/10.1016/b978-0-934613-64-4.50046-3openalex-snapshot
Two New Frameworks for Learning
inferredcites →https://doi.org/10.1016/b978-1-4832-1446-7.50034-0openalex-snapshot
Explanation-Based Generalization: A Unifying View
inferredcites →https://doi.org/10.1023/a:1022691120807openalex-snapshot
Explanation-Based Generalization: A Unifying View
inferredcites →https://doi.org/10.1023/a:1022869011914openalex-snapshot
Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm
inferredcites →https://doi.org/10.1109/sct.1988.5263openalex-snapshot
Reductions among prediction problems: on the difficulty of predicting automata
inferredcites →https://doi.org/10.1109/sfcs.1987.21openalex-snapshot
Diversity-based inference of finite automata
inferredcites →https://doi.org/10.1109/sfcs.1987.36openalex-snapshot
Learning one-counter languages in polynomial time
inferredcites →https://doi.org/10.1109/sfcs.1988.21928openalex-snapshot
Predicting (0, 1)-functions on randomly drawn points
inferredcites →https://doi.org/10.1137/0206049openalex-snapshot
Computational Complexity of Probabilistic Turing Machines
inferredcites →https://doi.org/10.1137/0221029openalex-snapshot
Probably Approximate Learning over Classes of Distributions
inferredcites →https://doi.org/10.1137/1116025openalex-snapshot
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
inferredcites →https://doi.org/10.1145/12130.12158openalex-snapshot
Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension
inferredcites →https://doi.org/10.1145/28395.28426openalex-snapshot
On the learnability of Boolean formulae
inferredcites →https://doi.org/10.1145/356914.356918openalex-snapshot
Inductive Inference: Theory and Methods
inferredcites →https://doi.org/10.7551/mitpress/5237.001.0001openalex-snapshot
Parallel Distributed Processing
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/asmb.534openalex-snapshot
A comparative study of multi‐class support vector machines in the unifying framework of large margin classifiers
inferred← citeshttps://doi.org/10.1002/jgt.22469openalex-snapshot
On density of subgraphs of Cartesian products
inferred← citeshttps://doi.org/10.1006/jcss.1995.1008openalex-snapshot
Characterizations of Learnability for Classes of {0, ..., n)-Valued Functions
inferred← citeshttps://doi.org/10.1006/jcta.2000.3160openalex-snapshot
A Lower Bound for Families of Natarajan Dimension d
inferred← citeshttps://doi.org/10.1007/11894841_30openalex-snapshot
Learning-Related Complexity of Linear Ranking Functions
inferred← citeshttps://doi.org/10.1007/3-540-44634-6_4openalex-snapshot
Using the Pseudo-Dimension to Analyze Approximation Algorithms for Integer Programming
inferred← citeshttps://doi.org/10.1007/3-540-45583-3_25openalex-snapshot
Extending Elementary Formal Systems
inferred← citeshttps://doi.org/10.1007/3-540-54563-8_97openalex-snapshot
Hybrid pattern recognition system capable of self-modification
inferred← citeshttps://doi.org/10.1007/3-540-57868-4_87openalex-snapshot
Complexity of computing generalized VC-dimensions
inferred← citeshttps://doi.org/10.1007/978-0-585-27366-2_9openalex-snapshot
The Probably Approximately Correct (PAC) and Other Learning Models
inferred← citeshttps://doi.org/10.1007/978-1-4471-1599-1_106openalex-snapshot
Multivariate Linear Regression on Classifier Outputs: a Capacity Study
inferred← citeshttps://doi.org/10.1007/978-1-4899-7687-1_100377openalex-snapshot
Probably Approximately Correct Learning
inferred← citeshttps://doi.org/10.1007/978-3-319-11662-4_20openalex-snapshot
Generalizing Labeled and Unlabeled Sample Compression to Multi-label Concept Classes
inferred← citeshttps://doi.org/10.1007/978-3-319-13129-0_28openalex-snapshot
Learning Economic Parameters from Revealed Preferences
inferred← citeshttps://doi.org/10.1007/978-3-319-96878-0_11openalex-snapshot
Limits of Practical Sublinear Secure Computation
inferred← citeshttps://doi.org/10.1007/978-3-540-24844-6_101openalex-snapshot
Learning with an Embedded Reject Option
inferred← citeshttps://doi.org/10.1007/978-3-540-45167-9_46openalex-snapshot
Learning with Equivalence Constraints and the Relation to Multiclass Learning
inferred← citeshttps://doi.org/10.1007/978-3-540-87987-9_37openalex-snapshot
Erratum: Constructing Multiclass Learners from Binary Learners: A Simple Black-Box Analysis of the Generalization Errors
inferred← citeshttps://doi.org/10.1007/978-981-15-1967-3_12openalex-snapshot
Computational Learning Theory
inferred← citeshttps://doi.org/10.1007/bf00114802openalex-snapshot
Learning Conjunctive Concepts in Structural Domains
inferred← citeshttps://doi.org/10.1007/bf00993865openalex-snapshot
Quantifying Prior Determination Knowledge Using the PAC Learning Model
inferred← citeshttps://doi.org/10.1007/bf03037091openalex-snapshot
Teachability in computational learning
inferred← citeshttps://doi.org/10.1007/bf03037530openalex-snapshot
Polynomial-time learning of elementary formal systems
inferred← citeshttps://doi.org/10.1007/bfb0030388openalex-snapshot
More about learning elementary formal systems
inferred← citeshttps://doi.org/10.1007/jhep07(2024)105openalex-snapshot
Neural network learning and Quantum Gravity
inferred← citeshttps://doi.org/10.1007/s00200-023-00619-1openalex-snapshot
Exploring implications of Trace (Inversion) formula and Artin algebras in extremal combinatorics
inferred← citeshttps://doi.org/10.1007/s100440200015openalex-snapshot
Combining Discriminant Models with New Multi-Class SVMs
inferred← citeshttps://doi.org/10.1007/s11263-025-02701-2openalex-snapshot
Bilateral Transformation of Biased Pseudo-Labels under Distribution Inconsistency
inferred← citeshttps://doi.org/10.1007/s11750-014-0340-1openalex-snapshot
Comments on: Support Vector Machines Maximizing Geometric Margins for Multi-class Classification
inferred← citeshttps://doi.org/10.1016/0020-0255(96)00082-5openalex-snapshot
Interactive learning of monotone Boolean functions
inferred← citeshttps://doi.org/10.1016/0097-3165(95)90001-2openalex-snapshot
A generalization of Sauer's lemma
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90126-9openalex-snapshot
A result of Vapnik with applications
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00164-eopenalex-snapshot
Complexity of computing Vapnik-Chervonenkis dimension and some generalized dimensions
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90042-zopenalex-snapshot
Equivalence of models for polynomial learnability
inferred← citeshttps://doi.org/10.1016/0895-7177(95)00234-0openalex-snapshot
An approach to guided learning of boolean functions
inferred← citeshttps://doi.org/10.1016/b978-0-08-051055-2.50033-xopenalex-snapshot
BIBLIOGRAPHY OF RECENT MACHINE LEARNING RESEARCH 1985–1989
inferred← citeshttps://doi.org/10.1016/j.dam.2004.04.003openalex-snapshot
On data classification by iterative linear partitioning
inferred← citeshttps://doi.org/10.1016/j.dam.2004.06.005openalex-snapshot
Some connections between learning and optimization
inferred← citeshttps://doi.org/10.1016/j.disc.2012.01.030openalex-snapshot
VC bounds on the cardinality of nearly orthogonal function classes
inferred← citeshttps://doi.org/10.1016/j.ejc.2018.02.039openalex-snapshot
On density of subgraphs of halved cubes
inferred← citeshttps://doi.org/10.1016/j.ijar.2023.108969openalex-snapshot
Learning from fuzzy labels: Theoretical issues and algorithmic solutions
inferred← citeshttps://doi.org/10.1016/j.jcss.2011.12.027openalex-snapshot
Learning with stochastic inputs and adversarial outputs
inferred← citeshttps://doi.org/10.1016/j.jcss.2019.07.004openalex-snapshot
Proper learning of k-term DNF formulas from satisfying assignments
inferred← citeshttps://doi.org/10.1016/j.knosys.2025.114504openalex-snapshot
Monotonic learning in the PAC framework: A new perspective
inferred← citeshttps://doi.org/10.1016/j.neucom.2003.10.004openalex-snapshot
Combining protein secondary structure prediction models with ensemble methods of optimal complexity
inferred← citeshttps://doi.org/10.1016/j.neunet.2017.07.014openalex-snapshot
Stochastic separation theorems
inferred← citeshttps://doi.org/10.1016/j.orl.2026.107486openalex-snapshot
Score-based discrete decision rules for contextual constrained stochastic programming
inferred← citeshttps://doi.org/10.1016/j.patrec.2025.12.012openalex-snapshot
Bounds on the Natarajan dimension of a class of linear multi-class predictors
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00000-6openalex-snapshot
Combinatorial variability of vapnik-chervonenkis classes with applications to sample compression schemes
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00013-4openalex-snapshot
Scale-sensitive dimensions and skeleton estimates for classification
inferred← citeshttps://doi.org/10.1016/s0167-6911(98)00005-xopenalex-snapshot
Learning dynamical systems in a stationary environment
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00418-8openalex-snapshot
Advanced elementary formal systems
inferred← citeshttps://doi.org/10.1016/s0305-0548(98)00042-2openalex-snapshot
Information availability vs. solution space size in a knowledge acquisition problem
inferred← citeshttps://doi.org/10.1016/s0924-6509(08)70034-5openalex-snapshot
Computational Learning Theory for Artificial Neural Networks
inferred← citeshttps://doi.org/10.1017/s096354830000198xopenalex-snapshot
Valid Generalisation from Approximate Interpolation
inferred← citeshttps://doi.org/10.1023/a:1022679002094openalex-snapshot
Noise-Tolerant Occam Algorithms and Their Applications to Learning Decision Trees
inferred← citeshttps://doi.org/10.1080/00207169508804450openalex-snapshot
Learning lipschitz functions
inferred← citeshttps://doi.org/10.1080/03610920903140288openalex-snapshot
Sample Complexity of Classifiers Taking Values in ℝQ, Application to Multi-Class SVMs
inferred← citeshttps://doi.org/10.1080/03610926.2013.776081openalex-snapshot
Combining Multi-class SVMs with Linear Ensemble Methods that Estimate the Class Posterior Probabilities
inferred← citeshttps://doi.org/10.1080/07350015.2024.2442672openalex-snapshot
Model Selection for Multivalued-Treatment Policy Learning in Observational Studies
inferred← citeshttps://doi.org/10.1080/09528139108915290openalex-snapshot
The gap between abstract and concrete results in machine learning
inferred← citeshttps://doi.org/10.1088/0954-898x/2/1/006openalex-snapshot
Sample sizes for multiple-output threshold networks
inferred← citeshttps://doi.org/10.1109/21.281430openalex-snapshot
N-learners problem: fusion of concepts
inferred← citeshttps://doi.org/10.1109/34.297960openalex-snapshot
Learning separations by Boolean combinations of half-spaces
inferred← citeshttps://doi.org/10.1109/9.489275openalex-snapshot
Learning by canonical smooth estimation. I. Simultaneous estimation
inferred← citeshttps://doi.org/10.1109/9.489276openalex-snapshot
Learning by canonical smooth estimation. II. Learning and choice of model complexity
inferred← citeshttps://doi.org/10.1109/cdc.1996.573117openalex-snapshot
Learning dynamical systems in a stationary environment
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00070openalex-snapshot
A Theory of PAC Learnability of Partial Concept Classes
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00093openalex-snapshot
A Characterization of Multiclass Learnability
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00071openalex-snapshot
Optimal PAC Bounds without Uniform Convergence
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00117openalex-snapshot
Exploration is Harder than Prediction: Cryptographically Separating Reinforcement Learning from Supervised Learning
inferred← citeshttps://doi.org/10.1109/fuzz45933.2021.9494497openalex-snapshot
Learning from Imprecise Observations: An Estimation Error Bound based on Fuzzy Random Variables
inferred← citeshttps://doi.org/10.1109/fuzz45933.2021.9494534openalex-snapshot
Learnability in “Learning from Fuzzy Labels”
inferred← citeshttps://doi.org/10.1109/hicss.1992.183220openalex-snapshot
A learning algorithm for elementary formal systems and its experiments on identification of transmembrane domains
inferred← citeshttps://doi.org/10.1109/hicss.1993.270664openalex-snapshot
Finding alphabet indexing for decision trees over regular patterns: an approach to bioinformatical knowledge acquisition
inferred← citeshttps://doi.org/10.1109/icicml60161.2023.10424837openalex-snapshot
A Review of Research on Generalization Error Analysis of Deep Learning Models
inferred← citeshttps://doi.org/10.1109/ijcnn.2000.860769openalex-snapshot
Generalization performance of multiclass discriminant models
inferred← citeshttps://doi.org/10.1109/isit.2016.7541669openalex-snapshot
Rate-distortion bounds on Bayes risk in supervised learning
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206618openalex-snapshot
Upper bounds on the Natarajan dimensions of some function classes
inferred← citeshttps://doi.org/10.1109/ita.2016.7888187openalex-snapshot
Sample compression schemes for VC classes
inferred← citeshttps://doi.org/10.1109/secon.1991.147876openalex-snapshot
Hybrid intelligent perception system
inferred← citeshttps://doi.org/10.1109/spw.2015.17openalex-snapshot
Grammatical Inference and Language Frameworks for LANGSEC
inferred← citeshttps://doi.org/10.1109/tit.2019.2893916openalex-snapshot
Data-Dependent Generalization Bounds for Multi-Class Classification
inferred← citeshttps://doi.org/10.1109/tit.2020.3008058openalex-snapshot
k-Vectors: An Alternating Minimization Algorithm for Learning Regression Functions
inferred← citeshttps://doi.org/10.1109/tit.2021.3075137openalex-snapshot
Multiclass Classification by Sparse Multinomial Logistic Regression
inferred← citeshttps://doi.org/10.1109/tpami.2024.3404450openalex-snapshot
Triplet Adaptation Framework for Robust Semi-Supervised Learning
inferred← citeshttps://doi.org/10.1111/j.1467-8640.1990.tb00298.xopenalex-snapshot
Learning hard concepts through constructive induction: framework and rationale
inferred← citeshttps://doi.org/10.1111/j.1467-8640.1992.tb00370.xopenalex-snapshot
USING DISTRIBUTION‐FREE LEARNING THEORY TO ANALYZE SOLUTION‐PATH CACHING MECHANISMS
inferred← citeshttps://doi.org/10.1134/s105466181604009xopenalex-snapshot
Tight risk bounds for multi-class margin classifiers
inferred← citeshttps://doi.org/10.1137/1.9781611973075.50openalex-snapshot
Universal ε-approximators for integrals
inferred← citeshttps://doi.org/10.1137/15m1045971openalex-snapshot
Inapproximability of Truthful Mechanisms via Generalizations of the Vapnik--Chervonenkis Dimension
inferred← citeshttps://doi.org/10.1137/23m159915xopenalex-snapshot
Optimal Prediction Using Expert Advice and Randomized Littlestone Dimension
inferred← citeshttps://doi.org/10.1137/s0097539794277111openalex-snapshot
On Learning Functions from Noise-Free and Noisy Samples via Occam's Razor
inferred← citeshttps://doi.org/10.1145/130385.130423openalex-snapshot
Characterizations of learnability for classes of { O, …, n }-valued functions
inferred← citeshttps://doi.org/10.1145/162754.168697openalex-snapshot
Analysis of upper bound in Valiant's model for learning bounded CNF expressions
inferred← citeshttps://doi.org/10.1145/168304.168385openalex-snapshot
General bounds on the number of examples needed for learning probabilistic concepts
inferred← citeshttps://doi.org/10.1145/170088.170140openalex-snapshot
Hybrid pattern recognition system capable of self-modification
inferred← citeshttps://doi.org/10.1145/180139.181158openalex-snapshot
Fat-shattering and the learnability of real-valued functions
inferred← citeshttps://doi.org/10.1145/2746539.2746597openalex-snapshot
Inapproximability of Truthful Mechanisms via Generalizations of the VC Dimension
inferred← citeshttps://doi.org/10.1145/2890490openalex-snapshot
Sample Compression Schemes for VC Classes
inferred← citeshttps://doi.org/10.1145/3391403.3399509openalex-snapshot
A Learning Framework for Distribution-Based Game-Theoretic Solution Concepts
inferred← citeshttps://doi.org/10.1145/3564246.3585190openalex-snapshot
A Characterization of List Learnability
inferred← citeshttps://doi.org/10.1145/3580374openalex-snapshot
A Learning Framework for Distribution-Based Game-Theoretic Solution Concepts
inferred← citeshttps://doi.org/10.1145/3618260.3649707openalex-snapshot
On Optimal Coreset Construction for Euclidean (k,z)-Clustering
inferred← citeshttps://doi.org/10.1145/3627817openalex-snapshot
It Is All about Data: A Survey on the Effects of Data on Adversarial Robustness
inferred← citeshttps://doi.org/10.1145/3637528.3671842openalex-snapshot
Iterative Weak Learnability and Multiclass AdaBoost
inferred← citeshttps://doi.org/10.1145/3798129.3800885openalex-snapshot
Optimal Phylogenetic Reconstruction from Sampled Quartets
inferred← citeshttps://doi.org/10.1155/2022/9518303openalex-snapshot
Complexity: Frontiers in Data‐Driven Methods for Understanding, Prediction, and Control of Complex Systems 2022 on the Development of Information Theoretic Model Selection Criteria for the Analysis of Experimental Data
inferred← citeshttps://doi.org/10.11606/t.45.2019.tde-02042019-231050openalex-snapshot
Model selection for learning boolean hypothesis
inferred← citeshttps://doi.org/10.11606/t.45.2022.tde-09082022-154351openalex-snapshot
A data-driven systematic, consistent and non-exhaustive approach to Model Selection
inferred← citeshttps://doi.org/10.1214/25-aos2511openalex-snapshot
Policy learning “without” overlap: Pessimism and generalized empirical Bernstein’s inequality
inferred← citeshttps://doi.org/10.1287/educ.2022.0249openalex-snapshot
Integrating Prediction/Estimation and Optimization with Applications in Operations Management
inferred← citeshttps://doi.org/10.1287/mnsc.2023.4678openalex-snapshot
Distributionally Robust Batch Contextual Bandits
inferred← citeshttps://doi.org/10.1287/moor.2022.1330openalex-snapshot
Generalization Bounds in the Predict-Then-Optimize Framework
inferred← citeshttps://doi.org/10.1587/transfun.2022eap1052openalex-snapshot
Parameterized Formal Graph Systems and Their Polynomial-Time PAC Learnability
inferred← citeshttps://doi.org/10.1609/aaai.v28i1.8914openalex-snapshot
Agent Behavior Prediction and Its Generalization Analysis
inferred← citeshttps://doi.org/10.1609/aaai.v35i13.17364openalex-snapshot
Robustness of Accuracy Metric and its Inspirations in Learning with Noisy Labels
inferred← citeshttps://doi.org/10.1609/aaai.v35i14.17451openalex-snapshot
Generalization in Portfolio-Based Algorithm Selection
inferred← citeshttps://doi.org/10.1609/aaai.v36i5.20422openalex-snapshot
The Complexity of Learning Approval-Based Multiwinner Voting Rules
inferred← citeshttps://doi.org/10.1609/aaai.v36i6.20600openalex-snapshot
First-Order Convex Fitting and Its Application to Economics and Optimization
inferred← citeshttps://doi.org/10.1609/aaai.v37i6.25822openalex-snapshot
Tree Learning: Optimal Sample Complexity and Algorithms
inferred← citeshttps://doi.org/10.1609/aaai.v37i8.26147openalex-snapshot
Automata Cascades: Expressivity and Sample Complexity
inferred← citeshttps://doi.org/10.1609/aaai.v38i13.29390openalex-snapshot
Learning the Topology and Behavior of Discrete Dynamical Systems
inferred← citeshttps://doi.org/10.18653/v1/2023.findings-emnlp.485openalex-snapshot
Pseudointelligence: A Unifying Lens on Language Model Evaluation
inferred← citeshttps://doi.org/10.2172/10133402openalex-snapshot
N-learners problem: Learning Boolean combinations of halfspaces
inferred← citeshttps://doi.org/10.2172/5241320openalex-snapshot
N-learners problem: Fusion of concepts
inferred← citeshttps://doi.org/10.22331/q-2025-07-29-1813openalex-snapshot
Quantum Learning Theory Beyond Batch Binary Classification
inferred← citeshttps://doi.org/10.24963/ijcai.2020/407openalex-snapshot
Learning From Multi-Dimensional Partial Labels
inferred← citeshttps://doi.org/10.26686/wgtn.17014700openalex-snapshot
Domain Adaptation and Domain Generalization with Representation Learning
inferred← citeshttps://doi.org/10.26686/wgtn.17014700.v1openalex-snapshot
Domain Adaptation and Domain Generalization with Representation Learning
inferred← citeshttps://doi.org/10.37236/9273openalex-snapshot
A Sauer–Shelah–Perles Lemma for Lattices
inferred← citeshttps://doi.org/10.4230/lipics.tqc.2021.3openalex-snapshot
Sample Efficient Algorithms for Learning Quantum Channels in PAC Model and the Approximate State Discrimination Problem
inferred← citeshttps://doi.org/10.46298/theoretics.24.2openalex-snapshot
Realizable Learning is All You Need
inferred← citeshttps://doi.org/10.48550/arxiv.1007.4915openalex-snapshot
VC bounds on the cardinality of nearly orthogonal function classes
inferred← citeshttps://doi.org/10.48550/arxiv.1308.2893openalex-snapshot
Multiclass learnability and the ERM principle
inferred← citeshttps://doi.org/10.48550/arxiv.1405.2420openalex-snapshot
Optimal Learners for Multiclass Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1503.06960openalex-snapshot
Sample compression schemes for VC classes
inferred← citeshttps://doi.org/10.48550/arxiv.1610.03592openalex-snapshot
On statistical learning via the lens of compression
inferred← citeshttps://doi.org/10.48550/arxiv.1902.04217openalex-snapshot
VC Classes are Adversarially Robustly Learnable, but Only Improperly
inferred← citeshttps://doi.org/10.48550/arxiv.1909.02506openalex-snapshot
$\sqrt{n}$-Regret for Learning in Markov Decision Processes with Function Approximation and Low Bellman Rank
inferred← citeshttps://doi.org/10.48550/arxiv.1911.11936openalex-snapshot
Generalizing Complex Hypotheses on Product Distributions: Auctions, Prophet Inequalities, and Pandora's Problem
inferred← citeshttps://doi.org/10.48550/arxiv.2010.03104openalex-snapshot
Instance-Dependent Complexity of Contextual Bandits and Reinforcement Learning: A Disagreement-Based Perspective
inferred← citeshttps://doi.org/10.48550/arxiv.2012.04115openalex-snapshot
Generalization bounds for deep learning
inferred← citeshttps://doi.org/10.48550/arxiv.2102.09492openalex-snapshot
Optimizing Black-box Metrics with Iterative Example Weighting
inferred← citeshttps://doi.org/10.48550/arxiv.2106.03632openalex-snapshot
Quantifying and Improving Transferability in Domain Generalization
inferred← citeshttps://doi.org/10.48550/arxiv.2107.10870openalex-snapshot
Multiclass versus Binary Differentially Private PAC Learning
inferred← citeshttps://doi.org/10.5555/1873601.1873651openalex-snapshot
Universal ε-approximators for integrals
inferred← citeshttps://doi.org/10.5555/2095116.2095222openalex-snapshot
Data reduction for weighted and outlier-resistant clustering
inferred← citeshttps://doi.org/10.70675/0daeac85z1b10z4ec2zaf23zecc28c279530openalex-snapshot
Densité, VC-dimension et étiquetages de graphes
inferred← citeshttps://doi.org/10.70675/356cfbf4zae36z4d48z89d2z74ad34d6ef5eopenalex-snapshot
Architecture d’apprentissage hybride pour la détection de défauts à partir d’images de fuselage d’avion acquises par un drone autonome
inferred← citeshttps://doi.org/10.70675/81e3c194z60d8z46b7z8ff4ze99c655067a1openalex-snapshot
Generalization Performance of Margin Multi-category Classifiers
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.