On the public citation graph

Information-Theoretic Generalization Bounds for Meta-Learning and Applications

0 signed · 55 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.1007/978-1-4612-1358-1_29openalex-snapshot
Rademacher Processes and Bounding the Risk of Function Learning
inferredcites →https://doi.org/10.1007/978-1-4615-5529-2openalex-snapshot
Learning to Learn
inferredcites →https://doi.org/10.1007/s10994-016-5594-4openalex-snapshot
Fast rates by transferring from auxiliary hypotheses
inferredcites →https://doi.org/10.1017/9781108627771openalex-snapshot
High-Dimensional Statistics
inferredcites →https://doi.org/10.1017/cbo9781107298019openalex-snapshot
Understanding Machine Learning
inferredcites →https://doi.org/10.1023/a:1019956318069openalex-snapshot
A Perspective View and Survey of Meta-Learning
inferredcites →https://doi.org/10.1038/nature02341openalex-snapshot
General conditions for predictivity in learning theory
inferredcites →https://doi.org/10.1093/acprof:oso/9780199535255.001.0001openalex-snapshot
Concentration Inequalities
inferredcites →https://doi.org/10.1109/6gsummit49458.2020.9083856openalex-snapshot
From Learning to Meta-Learning: Reduced Training Overhead and Complexity for Communication Systems
inferredcites →https://doi.org/10.1109/isit.2017.8006774openalex-snapshot
Dependence measures bounding the exploration bias for general measurements
inferredcites →https://doi.org/10.1109/isit.2018.8437470openalex-snapshot
Computable Bounds on the Exploration Bias
inferredcites →https://doi.org/10.1109/isit.2018.8437571openalex-snapshot
Generalization Error Bounds for Noisy, Iterative Algorithms
inferredcites →https://doi.org/10.1109/isit.2019.8849590openalex-snapshot
Tightening Mutual Information Based Bounds on Generalization Error
inferredcites →https://doi.org/10.1109/isit.2019.8849834openalex-snapshot
Strengthened Information-theoretic Bounds on the Generalization Error
inferredcites →https://doi.org/10.1109/tit.1979.1056087openalex-snapshot
Distribution-free performance bounds for potential function rules
inferredcites →https://doi.org/10.1111/rssb.12158openalex-snapshot
A General Framework for Updating Belief 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/1143844.1143902openalex-snapshot
Personalized handwriting recognition via biased regularization
inferredcites →https://doi.org/10.1145/2746539.2746580openalex-snapshot
Preserving Statistical Validity in Adaptive Data Analysis
inferredcites →https://doi.org/10.1145/2897518.2897566openalex-snapshot
Algorithmic stability for adaptive data analysis
inferredcites →https://doi.org/10.1145/307400.307435openalex-snapshot
PAC-Bayesian model averaging
inferredcites →https://doi.org/10.1162/089976699300016304openalex-snapshot
Algorithmic Stability and Sanity-Check Bounds for Leave-One-Out Cross-Validation
inferredcites →https://doi.org/10.1201/b15991openalex-snapshot
Handbook of Differential Entropy
inferredcites →https://doi.org/10.1214/aos/1176344196openalex-snapshot
A Finite Sample Distribution-Free Performance Bound for Local Discrimination Rules
inferredcites →https://doi.org/10.1561/2000000102openalex-snapshot
A Brief Introduction to Machine Learning for Engineers
inferredcites →https://doi.org/10.1613/jair.731openalex-snapshot
A Model of Inductive Bias Learning
inferredcites →https://doi.org/10.3390/e22040438openalex-snapshot
Towards a Unified Theory of Learning and Information
inferredcites →https://doi.org/10.48550/arxiv.1301.0579openalex-snapshot
Almost-everywhere algorithmic stability and generalization error
inferredcites →https://doi.org/10.48550/arxiv.1703.03400openalex-snapshot
Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks
inferredcites →https://doi.org/10.48550/arxiv.1705.07809openalex-snapshot
Information-theoretic analysis of generalization capability of learning algorithms
inferredcites →https://doi.org/10.48550/arxiv.1711.01244openalex-snapshot
Meta-Learning by Adjusting Priors Based on Extended PAC-Bayes Theory
inferredcites →https://doi.org/10.48550/arxiv.1806.03803openalex-snapshot
Chaining Mutual Information and Tightening Generalization Bounds
inferredcites →https://doi.org/10.48550/arxiv.1911.02151openalex-snapshot
Information-Theoretic Generalization Bounds for SGLD via Data-Dependent Estimates

What points at this work

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

inferred← citeshttps://doi.org/10.1016/j.neucom.2021.09.018openalex-snapshot
Statistical generalization performance guarantee for meta-learning with data dependent prior
inferred← citeshttps://doi.org/10.1016/j.neucom.2022.04.078openalex-snapshot
Meta-learning approaches for learning-to-learn in deep learning: A survey
inferred← citeshttps://doi.org/10.1063/5.0199881openalex-snapshot
Meta-Learning based efficient framework for diagnosing rare disorders: A comprehensive survey
inferred← citeshttps://doi.org/10.1109/icassp43922.2022.9746361openalex-snapshot
Predicting Flat-Fading Channels via Meta-Learned Closed-Form Linear Filters and Equilibrium Propagation
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9517767openalex-snapshot
An Information-Theoretic Analysis of the Impact of Task Similarity on Meta-Learning
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206566openalex-snapshot
On the Generalization Error of Meta Learning for the Gibbs Algorithm
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206951openalex-snapshot
Exactly Tight Information-Theoretic Generalization Error Bound for the Quadratic Gaussian Problem
inferred← citeshttps://doi.org/10.1109/jsait.2024.3380598openalex-snapshot
Exactly Tight Information-Theoretic Generalization Error Bound for the Quadratic Gaussian Problem
inferred← citeshttps://doi.org/10.1109/ojcoms.2024.3380512openalex-snapshot
Meta-Learning for Wireless Communications: A Survey and a Comparison to GNNs
inferred← citeshttps://doi.org/10.1109/spawc51858.2021.9593131openalex-snapshot
Fast Power Control Adaptation via Meta-Learning for Random Edge Graph Neural Networks
inferred← citeshttps://doi.org/10.1109/tccn.2025.3640114openalex-snapshot
Pre-Training and Personalized Fine-Tuning via Over-the-Air Federated Meta-Learning: Convergence-Generalization Trade-Offs
inferred← citeshttps://doi.org/10.1109/tcsvt.2026.3662700openalex-snapshot
Test-Time Domain-Agnostic Meta-Prompt Learning for Multi-Source Few-Shot Domain Adaptation
inferred← citeshttps://doi.org/10.1109/tit.2021.3119605openalex-snapshot
Transfer Meta-Learning: Information- Theoretic Bounds and Information Meta-Risk Minimization
inferred← citeshttps://doi.org/10.1109/tit.2022.3144615openalex-snapshot
Individually Conditional Individual Mutual Information Bound on Generalization Error
inferred← citeshttps://doi.org/10.1109/tit.2023.3329617openalex-snapshot
Information-Theoretic Characterizations of Generalization Error for the Gibbs Algorithm
inferred← citeshttps://doi.org/10.1109/tit.2025.3531136openalex-snapshot
How Does Distribution Matching Help Domain Generalization: An Information-Theoretic Analysis
inferred← citeshttps://doi.org/10.1561/2200000112openalex-snapshot
Generalization Bounds: Perspectives from Information Theory and PAC-Bayes
inferred← citeshttps://doi.org/10.2118/233780-paopenalex-snapshot
Quantitative Logging Characterization Method for Favorable Lithofacies of Tight Sandstone in the Lianggaoshan Formation, Northern Sichuan Basin
inferred← citeshttps://doi.org/10.3390/e25101394openalex-snapshot
Lossless Transformations and Excess Risk Bounds in Statistical Inference
inferred← citeshttps://doi.org/10.3390/e26110995openalex-snapshot
Information-Theoretic Generalization Bounds for Batch Reinforcement Learning
inferred← citeshttps://doi.org/10.3390/machines14091087openalex-snapshot
Shape-Regularized Meta-Learning Method for Performance Assessment of Solid Rocket Motors
inferred← citeshttps://doi.org/10.3390/polym17121667openalex-snapshot
Recent Progress of Artificial Intelligence Application in Polymer Materials
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.