{"total":39,"rows":[{"id":"2401.01286","title":"A Comprehensive Study of Knowledge Editing for Large Language Models","created":"2024-01-02","cited_by_count":163,"area":null},{"id":"2503.02113","title":"Deep Learning is Not So Mysterious or Different","created":"2025-03-03","cited_by_count":56,"area":null},{"id":"2410.02724","title":"Large Language Models as Markov Chains","created":"2024-10-03","cited_by_count":35,"area":null},{"id":"2407.18158","title":"Unlocking Tokens as Data Points for Generalization Bounds on Larger Language Models","created":"2024-07-25","cited_by_count":25,"area":null},{"id":"2412.09810","title":"The Complexity Dynamics of Grokking","created":"2024-12-13","cited_by_count":22,"area":null},{"id":"2405.01964","title":"Position: Understanding LLMs Requires More Than Statistical Generalization","created":"2024-05-03","cited_by_count":21,"area":null},{"id":"2410.01769","title":"Quantifying Generalization Complexity for Large Language Models","created":"2024-10-02","cited_by_count":18,"area":null},{"id":"2410.18779","title":"A Little Help Goes a Long Way: Efficient LLM Training by Leveraging Small LMs","created":"2024-10-24","cited_by_count":15,"area":null},{"id":"2506.14530","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","created":"2025-06-17","cited_by_count":11,"area":null},{"id":"2501.01558","title":"Predicting the Performance of Black-box LLMs through Follow-up Queries","created":"2025-01-02","cited_by_count":9,"area":null},{"id":"2509.22445","title":"Bridging Kolmogorov Complexity and Deep Learning: Asymptotically Optimal Description Length Objectives for Transformers","created":"2025-09-26","cited_by_count":6,"area":null},{"id":"2504.15208","title":"Compute-Optimal LLMs Provably Generalize Better With Scale","created":"2025-04-21","cited_by_count":5,"area":null},{"id":"2409.17932","title":"Sample Compression Unleashed: New Generalization Bounds for Real Valued Losses","created":"2024-09-26","cited_by_count":4,"area":null},{"id":"2406.11463","title":"Just How Flexible are Neural Networks in Practice?","created":"2024-06-17","cited_by_count":3,"area":null},{"id":"2410.13577","title":"Generalization Bounds via Meta-Learned Model Representations: PAC-Bayes and Sample Compression Hypernetworks","created":"2024-10-17","cited_by_count":3,"area":null},{"id":"2510.08413","title":"Prompts Generalize with Low Data: Non-vacuous Generalization Bounds for Optimizing Prompts with More Informative Priors","created":"2025-10-09","cited_by_count":3,"area":null},{"id":"2605.08896","title":"FragileFlow: Spectral Control of Correct-but-Fragile Predictions for Foundation Model Robustness","created":"2026-05-09","cited_by_count":3,"area":null},{"id":"2503.07325","title":"Non-vacuous Generalization Bounds for Deep Neural Networks without any modification to the trained models","created":"2025-03-10","cited_by_count":2,"area":null},{"id":"2505.15798","title":"Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning","created":"2025-05-21","cited_by_count":2,"area":null},{"id":"2506.12903","title":"Variational Learning Finds Flatter Solutions at the Edge of Stability","created":"2025-06-15","cited_by_count":2,"area":null},{"id":"2512.05267","title":"Uncertainty Quantification and Data Efficiency in AI: An Information-Theoretic Perspective","created":"2025-12-04","cited_by_count":2,"area":null},{"id":"2601.01465","title":"Leveraging Flatness to Improve Information-Theoretic Generalization Bounds for SGD","created":"2026-01-04","cited_by_count":2,"area":null},{"id":"2602.00906","title":"Hallucination is a Consequence of Space-Optimality: A Rate-Distortion Theorem for Membership Testing","created":"2026-01-31","cited_by_count":2,"area":null},{"id":"2602.23128","title":"Bound to Disagree: Generalization Bounds via Certifiable Surrogates","created":"2026-02-26","cited_by_count":2,"area":null},{"id":"2409.01498","title":"A practical generalization metric for deep networks benchmarking","created":"2024-09-02","cited_by_count":1,"area":null},{"id":"2410.00477","title":"ViDAS: Vision-based Danger Assessment and Scoring","created":"2024-10-01","cited_by_count":1,"area":null},{"id":"2509.15932","title":"The Alignment Bottleneck","created":"2025-09-19","cited_by_count":1,"area":null},{"id":"2604.13609","title":"Golden Handcuffs make safer AI agents","created":"2026-04-15","cited_by_count":1,"area":null},{"id":"2502.06970","title":"Model Diffusion for Certifiable Few-shot Transfer Learning","created":"2025-02-10","cited_by_count":0,"area":null},{"id":"2502.17305","title":"`Generalization is hallucination' through the lens of tensor completions","created":"2025-02-24","cited_by_count":0,"area":null},{"id":"2509.07963","title":"Customizing the Inductive Biases of Softmax Attention using Structured Matrices","created":"2025-09-09","cited_by_count":0,"area":null},{"id":"2603.00910","title":"Curvature-Weighted Capacity Allocation: A Minimum Description Length Framework for Layer-Adaptive Large Language Model Optimization","created":"2026-03-01","cited_by_count":0,"area":null},{"id":"2604.17219","title":"PAC-Bayes Bounds for Gibbs Posteriors via Singular Learning Theory","created":"2026-04-19","cited_by_count":0,"area":null},{"id":"2605.26222","title":"From Privacy to Generalization: Linear Max-Information Bounds for Differentially Private Learning Algorithms","created":"2026-05-25","cited_by_count":0,"area":null},{"id":"2606.20999","title":"Inductive Generalization for Robotic Manipulation","created":"2026-06-19","cited_by_count":0,"area":null},{"id":"2607.01006","title":"Understanding Large Language Models","created":"2026-07-01","cited_by_count":0,"area":null},{"id":"2609.32271","title":"Certification Frontiers for Gaussian LoRA: Independent Priors, Posterior Risk, and Prediction-Preserving Balancing","created":"2026-09-26","cited_by_count":0,"area":null},{"id":"2609.32818","title":"When Can First-Order Models of Fine-Tuning Bound Forgetting?","created":"2026-09-26","cited_by_count":0,"area":null},{"id":"2609.34458","title":"Understanding Generalization Requires Universal Induction","created":"2026-09-28","cited_by_count":0,"area":null}],"next_cursor":null}