On the public citation graph

Surrogate losses in passive and active learning

0 signed · 66 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jcss.1997.1504openalex-snapshot
A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting
inferredcites →https://doi.org/10.1007/3-540-44581-1_15openalex-snapshot
Rademacher and Gaussian Complexities: Risk Bounds and Structural Results
inferredcites →https://doi.org/10.1007/978-1-4419-5821-1_19openalex-snapshot
Universal Donsker Classes and Metric Entropy
inferredcites →https://doi.org/10.1007/978-1-4612-5254-2openalex-snapshot
Convergence of Stochastic Processes
inferredcites →https://doi.org/10.1007/978-1-4757-2545-2_3openalex-snapshot
Weak Convergence
inferredcites →https://doi.org/10.1007/978-3-0348-8069-5_15openalex-snapshot
Ratio Limit Theorems for Empirical Processes
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/b13794openalex-snapshot
Introduction to Nonparametric Estimation
inferredcites →https://doi.org/10.1007/bf00116829openalex-snapshot
Learning From Noisy Examples
inferredcites →https://doi.org/10.1007/bf00318708openalex-snapshot
Rates of growth and sample moduli for weighted empirical processes indexed by sets
inferredcites →https://doi.org/10.1007/bf00993468openalex-snapshot
Toward efficient agnostic learning
inferredcites →https://doi.org/10.1007/bf00994018openalex-snapshot
Support-Vector Networks
inferredcites →https://doi.org/10.1007/s10994-010-5174-yopenalex-snapshot
The true sample complexity of active learning
inferredcites →https://doi.org/10.1007/s10994-010-5191-xopenalex-snapshot
Learning noisy linear classifiers via adaptive and selective sampling
inferredcites →https://doi.org/10.1016/0890-5401(92)90010-dopenalex-snapshot
Decision theoretic generalizations of the PAC model for neural net and other learning applications
inferredcites →https://doi.org/10.1016/j.jcss.2008.07.003openalex-snapshot
Agnostic active learning
inferredcites →https://doi.org/10.1017/cbo9780511642401.015openalex-snapshot
Introduction to non-parametric estimation
inferredcites →https://doi.org/10.1109/18.930926openalex-snapshot
Rademacher penalties and structural risk minimization
inferredcites →https://doi.org/10.1109/sfcs.2005.13openalex-snapshot
Agnostically Learning Halfspaces
inferredcites →https://doi.org/10.1109/tit.2008.920189openalex-snapshot
Minimax Bounds for Active Learning
inferredcites →https://doi.org/10.1137/060649057openalex-snapshot
Agnostically Learning Halfspaces
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/1273496.1273541openalex-snapshot
A bound on the label complexity of agnostic active learning
inferredcites →https://doi.org/10.1145/130385.130424openalex-snapshot
Toward efficient agnostic learning
inferredcites →https://doi.org/10.1145/1553374.1553381openalex-snapshot
Importance weighted active learning
inferredcites →https://doi.org/10.1145/293347.293351openalex-snapshot
Efficient noise-tolerant learning from statistical queries
inferredcites →https://doi.org/10.1198/016214505000000907openalex-snapshot
Convexity, Classification, and Risk Bounds
inferredcites →https://doi.org/10.1214/009053605000000282openalex-snapshot
Local Rademacher complexities
inferredcites →https://doi.org/10.1214/009053606000001019openalex-snapshot
Local Rademacher complexities and oracle inequalities in risk minimization
inferredcites →https://doi.org/10.1214/009053606000001217openalex-snapshot
Fast learning rates for plug-in classifiers
inferredcites →https://doi.org/10.1214/009117906000000070openalex-snapshot
Concentration inequalities and asymptotic results for ratio type empirical processes
inferredcites →https://doi.org/10.1214/10-aos843openalex-snapshot
Rates of convergence in active learning
inferredcites →https://doi.org/10.1214/11-ejs605openalex-snapshot
A local maximal inequality under uniform entropy
inferredcites →https://doi.org/10.1214/aop/1176991978openalex-snapshot
Universal Donsker Classes and Metric Entropy
inferredcites →https://doi.org/10.1214/aop/1176995384openalex-snapshot
Central Limit Theorems for Empirical Measures
inferredcites →https://doi.org/10.1214/aos/1017939240openalex-snapshot
Smooth discrimination analysis
inferredcites →https://doi.org/10.1214/aos/1079120130openalex-snapshot
Statistical behavior and consistency of classification methods based on convex risk minimization
inferredcites →https://doi.org/10.1214/aos/1079120131openalex-snapshot
Optimal aggregation of classifiers in statistical learning
inferredcites →https://doi.org/10.1214/aos/1176350374openalex-snapshot
$U$-Processes: Rates of Convergence
inferredcites →https://doi.org/10.1214/cbms/1462061091openalex-snapshot
Empirical Processes
inferredcites →https://doi.org/10.1561/2200000037openalex-snapshot
Theory of Disagreement-Based Active Learning
inferredcites →https://doi.org/10.1561/9781601988096openalex-snapshot
Theory of Disagreement-Based Active Learning
inferredcites →https://doi.org/10.2307/2553898openalex-snapshot
Convergence of Stochastic Processes.
inferredcites →https://doi.org/10.2307/2965734openalex-snapshot
Weak Convergence and Empirical Processes
inferredcites →https://doi.org/10.3923/ajms.2011.66.70openalex-snapshot
Concise Formulas for the Area and Volume of a Hyperspherical Cap
inferredcites →https://doi.org/10.48550/arxiv.1103.3095openalex-snapshot
A note on active learning for smooth problems
inferredcites →https://doi.org/10.48550/arxiv.1104.1450openalex-snapshot
Plug-in Approach to Active Learning
inferredcites →https://doi.org/10.48550/arxiv.1108.1766openalex-snapshot
Activized Learning: Transforming Passive to Active with Improved Label Complexity
inferredcites →https://doi.org/10.48550/arxiv.1703.05841openalex-snapshot
Adaptivity to Noise Parameters in Nonparametric Active Learning
inferredcites →https://doi.org/10.5555/945365.964298openalex-snapshot
On the rate of convergence of regularized boosting classifiers

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1109/icccs49078.2020.9118568openalex-snapshot
Optimal Training Data Selection in Active Learning for Discrimination and Classification
inferred← citeshttps://doi.org/10.1109/tcyb.2021.3069956openalex-snapshot
Cold-Start Active Sampling Via γ-Tube
inferred← citeshttps://doi.org/10.1109/tit.2022.3156592openalex-snapshot
Exponential Savings in Agnostic Active Learning Through Abstention
inferred← citeshttps://doi.org/10.1109/tsp.2022.3159388openalex-snapshot
Disagreement-Based Active Learning in Online Settings
inferred← citeshttps://doi.org/10.1145/3728716openalex-snapshot
Uncertainty-guided Active Learning with Theoretical Bounds on Label Complexity
inferred← citeshttps://doi.org/10.1561/2200000037openalex-snapshot
Theory of Disagreement-Based Active Learning
inferred← citeshttps://doi.org/10.48550/arxiv.1309.6830openalex-snapshot
Building Bridges: Viewing Active Learning from the Multi-Armed Bandit Lens
inferred← citeshttps://doi.org/10.48550/arxiv.1311.4803openalex-snapshot
Beating the Minimax Rate of Active Learning with Prior Knowledge
inferred← citeshttps://doi.org/10.48550/arxiv.1404.1504openalex-snapshot
A Compression Technique for Analyzing Disagreement-Based Active Learning
inferred← citeshttps://doi.org/10.48550/arxiv.1407.2657openalex-snapshot
Beyond Disagreement-based Agnostic Active Learning
inferred← citeshttps://doi.org/10.48550/arxiv.1410.0996openalex-snapshot
Minimax Analysis of Active Learning
inferred← citeshttps://doi.org/10.48550/arxiv.1503.03594openalex-snapshot
Efficient Learning of Linear Separators under Bounded Noise
inferred← citeshttps://doi.org/10.48550/arxiv.1512.07146openalex-snapshot
Refined Error Bounds for Several Learning Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1608.07159openalex-snapshot
Active Robust Learning
inferred← citeshttps://doi.org/10.48550/arxiv.1704.05820openalex-snapshot
Noise-Tolerant Interactive Learning from Pairwise Comparisons
inferred← citeshttps://doi.org/10.48550/arxiv.2106.09019openalex-snapshot
Amortized Synthesis of Constrained Configurations Using a Differentiable Surrogate
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.