{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/learning-theory/papers/3","list_of":"/task/learning-theory","task":"Learning Theory","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":3,"pages_in_order":9,"rows_per_page":100,"rows":[201,300],"of":852,"counts":{"archive_papers_tagged":852,"with_a_code_link":140,"where_syntology_ran_a_sample":44,"not_listed_spam_title":0,"listed":852,"listed_where_code_ran":44,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":37,"every_run_a_failure_of_syntologys_instrument":7,"listed_with_a_run_with_no_instrument_failure":37,"listed_every_run_a_failure_of_syntologys_instrument":7,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/learning-theory","prev":"/task/learning-theory/papers/2","next":"/task/learning-theory/papers/4","papers":[{"url":null,"slug":"a-theory-of-learning-unified-model-via","title":"A Theory of Learning Unified Model via Knowledge Integration from Label Space Varying Domains","date":"2025-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"hardness-of-learning-fixed-parities-with","title":"Hardness of Learning Fixed Parities with Neural Networks","date":"2025-01-01","arxiv_id":"2501.00817","repositories_listed":0,"syntology":null},{"url":null,"slug":"outlier-robust-linear-system-identification","title":"Outlier-Robust Linear System Identification Under Heavy-tailed Noise","date":"2024-12-31","arxiv_id":"2501.00421","repositories_listed":0,"syntology":null},{"url":null,"slug":"convergence-of-statistical-estimators-via","title":"Convergence of Statistical Estimators via Mutual Information Bounds","date":"2024-12-24","arxiv_id":"2412.18539","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-dependent-generalization-bounds-for-1","title":"Data-Dependent Generalization Bounds for Parameterized Quantum Models Under Noise","date":"2024-12-16","arxiv_id":"2412.11451","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-algorithm-centered-approach-to-model","title":"An Algorithm-Centered Approach To Model Streaming Data","date":"2024-12-12","arxiv_id":"2412.09118","repositories_listed":0,"syntology":null},{"url":null,"slug":"of-dice-and-games-a-theory-of-generalized","title":"Of Dice and Games: A Theory of Generalized Boosting","date":"2024-12-11","arxiv_id":"2412.08012","repositories_listed":0,"syntology":null},{"url":null,"slug":"effective-rank-and-the-staircase-phenomenon","title":"Effective Rank and the Staircase Phenomenon: New Insights into Neural Network Training Dynamics","date":"2024-12-06","arxiv_id":"2412.05144","repositories_listed":0,"syntology":null},{"url":null,"slug":"unified-inductive-logic-from-formal-learning","title":"Unified Inductive Logic: From Formal Learning to Statistical Inference to Supervised Learning","date":"2024-12-04","arxiv_id":"2412.02969","repositories_listed":0,"syntology":null},{"url":null,"slug":"geometry-of-fibers-of-the-multiplication-map","title":"Geometry of fibers of the multiplication map of deep linear neural networks","date":"2024-11-29","arxiv_id":"2411.19920","repositories_listed":0,"syntology":null},{"url":null,"slug":"learned-random-label-predictions-as-a-neural","title":"Learned Random Label Predictions as a Neural Network Complexity Metric","date":"2024-11-29","arxiv_id":"2411.19640","repositories_listed":0,"syntology":null},{"url":null,"slug":"incomplete-multi-view-multi-label","title":"Incomplete Multi-view Multi-label Classification via a Dual-level Contrastive Learning Framework","date":"2024-11-27","arxiv_id":"2411.18267","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-hierarchical-polynomials-of-multiple","title":"Learning Hierarchical Polynomials of Multiple Nonlinear Features with Three-Layer Networks","date":"2024-11-26","arxiv_id":"2411.17201","repositories_listed":0,"syntology":null},{"url":null,"slug":"statistical-inference-for-quantum-singular","title":"Statistical inference for quantum singular models","date":"2024-11-25","arxiv_id":"2411.16396","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-machine-learning-paradigms","title":"Understanding Machine Learning Paradigms through the Lens of Statistical Thermodynamics: A tutorial","date":"2024-11-24","arxiv_id":"2411.15945","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-sample-complexity-of-one-hidden-layer","title":"On the Sample Complexity of One Hidden Layer Networks with Equivariance, Locality and Weight Sharing","date":"2024-11-21","arxiv_id":"2411.14288","repositories_listed":0,"syntology":null},{"url":null,"slug":"omnipredicting-single-index-models-with-multi","title":"Omnipredicting Single-Index Models with Multi-Index Models","date":"2024-11-20","arxiv_id":"2411.13083","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-comparison-between-multi-modal-and","title":"On the Comparison between Multi-modal and Single-modal Contrastive Learning","date":"2024-11-05","arxiv_id":"2411.02837","repositories_listed":0,"syntology":null},{"url":null,"slug":"representative-social-choice-from-learning","title":"Representative Social Choice: From Learning Theory to AI Alignment","date":"2024-10-31","arxiv_id":"2410.23953","repositories_listed":0,"syntology":null},{"url":null,"slug":"generation-through-the-lens-of-learning","title":"Generation through the lens of learning theory","date":"2024-10-17","arxiv_id":"2410.13714","repositories_listed":0,"syntology":null},{"url":null,"slug":"agnostic-process-tomography","title":"Agnostic Process Tomography","date":"2024-10-15","arxiv_id":"2410.11957","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-championing-foundation-models-from","title":"A Theoretical Survey on Foundation Models","date":"2024-10-15","arxiv_id":"2410.11444","repositories_listed":0,"syntology":null},{"url":null,"slug":"structure-of-artificial-neural-networks","title":"Structure of Artificial Neural Networks -- Empirical Investigations","date":"2024-10-12","arxiv_id":"2410.09579","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-training-can-provably-improve","title":"Adversarial Training Can Provably Improve Robustness: Theoretical Analysis of Feature Learning Process Under Structured Data","date":"2024-10-11","arxiv_id":"2410.08503","repositories_listed":0,"syntology":null},{"url":null,"slug":"upper-bounds-for-learning-in-reproducing","title":"Upper Bounds for Learning in Reproducing Kernel Hilbert Spaces for Non IID Samples","date":"2024-10-10","arxiv_id":"2410.08361","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-epsilon-net-and-piercing-set-for","title":"Online Epsilon Net and Piercing Set for Geometric Concepts","date":"2024-10-09","arxiv_id":"2410.07059","repositories_listed":0,"syntology":null},{"url":null,"slug":"differentiation-and-specialization-of","title":"Differentiation and Specialization of Attention Heads via the Refined Local Learning Coefficient","date":"2024-10-03","arxiv_id":"2410.02984","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-pac-learning-of-halfspaces-with","title":"Efficient PAC Learning of Halfspaces with Constant Malicious Noise Rate","date":"2024-10-02","arxiv_id":"2410.01186","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-multi-source-data-power-load-forecasting","title":"A multi-source data power load forecasting method using attention mechanism-based parallel cnn-gru","date":"2024-09-26","arxiv_id":"2409.17889","repositories_listed":0,"syntology":null},{"url":null,"slug":"bridging-the-gap-between-approximation-and","title":"Bridging the Gap Between Approximation and Learning via Optimal Approximation by ReLU MLPs of Maximal Regularity","date":"2024-09-18","arxiv_id":"2409.12335","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-sample-complexity-of-smooth-boosting-and","title":"The Sample Complexity of Smooth Boosting and the Tightness of the Hardcore Theorem","date":"2024-09-17","arxiv_id":"2409.11597","repositories_listed":0,"syntology":null},{"url":null,"slug":"fairness-accuracy-and-unreliable-data","title":"Fairness, Accuracy, and Unreliable Data","date":"2024-08-28","arxiv_id":"2408.16040","repositories_listed":0,"syntology":null},{"url":null,"slug":"lecture-notes-on-linear-neural-networks-a","title":"Lecture Notes on Linear Neural Networks: A Tale of Optimization and Generalization in Deep Learning","date":"2024-08-25","arxiv_id":"2408.13767","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-learning-with-cnns-a-compact-holistic","title":"Deep Learning with CNNs: A Compact Holistic Tutorial with Focus on Supervised Regression (Preprint)","date":"2024-08-22","arxiv_id":"2408.12308","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-learning-for-linear-properties-of","title":"Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits","date":"2024-08-22","arxiv_id":"2408.12199","repositories_listed":0,"syntology":null},{"url":null,"slug":"transformers-are-minimax-optimal","title":"Transformers are Minimax Optimal Nonparametric In-Context Learners","date":"2024-08-22","arxiv_id":"2408.12186","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-classification-via-reference","title":"Graph Classification via Reference Distribution Learning: Theory and Practice","date":"2024-08-21","arxiv_id":"2408.11370","repositories_listed":0,"syntology":null},{"url":null,"slug":"revisiting-agnostic-pac-learning","title":"Revisiting Agnostic PAC Learning","date":"2024-07-29","arxiv_id":"2407.19777","repositories_listed":0,"syntology":null},{"url":null,"slug":"mathematical-theory-of-deep-learning","title":"Mathematical theory of deep learning","date":"2024-07-25","arxiv_id":"2407.18384","repositories_listed":0,"syntology":null},{"url":null,"slug":"five-reasons-against-assuming-a-data","title":"Which distribution were you sampled from? Towards a more tangible conception of data","date":"2024-07-24","arxiv_id":"2407.17395","repositories_listed":0,"syntology":null},{"url":null,"slug":"computable-learning-of-natural-hypothesis","title":"Computable learning of natural hypothesis classes","date":"2024-07-23","arxiv_id":"2407.16663","repositories_listed":0,"syntology":null},{"url":null,"slug":"inferring-ingrained-remote-information-in-ac","title":"Inferring Ingrained Remote Information in AC Power Flows Using Neuromorphic Modality Regime","date":"2024-07-20","arxiv_id":"2407.14883","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantum-maximum-entropy-inference-and","title":"Quantum Maximum Entropy Inference and Hamiltonian Learning","date":"2024-07-16","arxiv_id":"2407.11473","repositories_listed":0,"syntology":null},{"url":null,"slug":"topological-generalization-bounds-for","title":"Topological Generalization Bounds for Discrete-Time Stochastic Optimization Algorithms","date":"2024-07-11","arxiv_id":"2407.08723","repositories_listed":0,"syntology":null},{"url":null,"slug":"10-years-of-fair-representations-challenges","title":"10 Years of Fair Representations: Challenges and Opportunities","date":"2024-07-04","arxiv_id":"2407.03834","repositories_listed":0,"syntology":null},{"url":null,"slug":"foundations-and-frontiers-of-graph-learning","title":"Foundations and Frontiers of Graph Learning Theory","date":"2024-07-03","arxiv_id":"2407.03125","repositories_listed":0,"syntology":null},{"url":null,"slug":"present-and-future-of-ai-in-renewable-energy","title":"Present and Future of AI in Renewable Energy Domain : A Comprehensive Survey","date":"2024-06-22","arxiv_id":"2406.16965","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-general-control-theoretic-approach-for","title":"A General Control-Theoretic Approach for Reinforcement Learning: Theory and Algorithms","date":"2024-06-20","arxiv_id":"2406.14753","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-sum-of-diverse-features","title":"Learning sum of diverse features: computational hardness and efficient gradient-based training for ridge combinations","date":"2024-06-17","arxiv_id":"2406.11828","repositories_listed":0,"syntology":null},{"url":null,"slug":"grod-enhancing-generalization-of-transformer","title":"How Out-of-Distribution Detection Learning Theory Enhances Transformer: Learnability and Reliability","date":"2024-06-13","arxiv_id":"2406.12915","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-noise-robustness-through","title":"Improving Noise Robustness through Abstractions and its Impact on Machine Learning","date":"2024-06-12","arxiv_id":"2406.08428","repositories_listed":0,"syntology":null},{"url":null,"slug":"general-distribution-learning-a-theoretical","title":"Probability Distribution Learning and Its Application in Deep Learning","date":"2024-06-09","arxiv_id":"2406.05666","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-multi-baseline-sar-cross-modal-3d","title":"CMAR-Net: Accurate Cross-Modal 3D SAR Reconstruction of Vehicle Targets with Sparse-Aspect Multi-Baseline Data","date":"2024-06-06","arxiv_id":"2406.04158","repositories_listed":0,"syntology":null},{"url":null,"slug":"coded-computing-a-learning-theoretic","title":"Coded Computing for Resilient Distributed Computing: A Learning-Theoretic Framework","date":"2024-06-01","arxiv_id":"2406.00300","repositories_listed":0,"syntology":null},{"url":null,"slug":"review-and-prospect-of-algebraic-research-in","title":"Review and Prospect of Algebraic Research in Equivalent Framework between Statistical Mechanics and Machine Learning Theory","date":"2024-05-31","arxiv_id":"2406.10234","repositories_listed":0,"syntology":null},{"url":null,"slug":"weak-robust-compatibility-between-learning","title":"Weak Robust Compatibility Between Learning Algorithms and Counterfactual Explanation Generation Algorithms","date":"2024-05-31","arxiv_id":"2405.20664","repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-discrepancy-a-closer-look-at-the","title":"Beyond Discrepancy: A Closer Look at the Theory of Distribution Shift","date":"2024-05-29","arxiv_id":"2405.19156","repositories_listed":0,"syntology":null},{"url":null,"slug":"dual-vc-dimension-obstructs-sample","title":"Dual VC Dimension Obstructs Sample Compression by Embeddings","date":"2024-05-27","arxiv_id":"2405.17120","repositories_listed":0,"syntology":null},{"url":null,"slug":"is-algorithmic-stability-testable-a-unified","title":"Is Algorithmic Stability Testable? A Unified Framework under Computational Constraints","date":"2024-05-23","arxiv_id":"2405.15107","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-contextual-online-learning-theory-of","title":"A Contextual Online Learning Theory of Brokerage","date":"2024-05-22","arxiv_id":"2407.01566","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-regularities-from-data-using-spiking","title":"Learning Regularities from Data using Spiking Functions: A Theory","date":"2024-05-19","arxiv_id":"2405.11684","repositories_listed":0,"syntology":null},{"url":null,"slug":"preparing-for-black-swans-the-antifragility","title":"Preparing for Black Swans: The Antifragility Imperative for Machine Learning","date":"2024-05-18","arxiv_id":"2405.11397","repositories_listed":0,"syntology":null},{"url":null,"slug":"using-degeneracy-in-the-loss-landscape-for","title":"Using Degeneracy in the Loss Landscape for Mechanistic Interpretability","date":"2024-05-17","arxiv_id":"2405.10927","repositories_listed":0,"syntology":null},{"url":null,"slug":"nonparametric-control-koopman-operator","title":"Nonparametric Control Koopman Operators","date":"2024-05-12","arxiv_id":"2405.07312","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-semi-supervised-learning-by-wisely","title":"Robust Semi-supervised Learning by Wisely Leveraging Open-set Data","date":"2024-05-11","arxiv_id":"2405.06979","repositories_listed":0,"syntology":null},{"url":null,"slug":"is-transductive-learning-equivalent-to-pac","title":"Is Transductive Learning Equivalent to PAC Learning?","date":"2024-05-08","arxiv_id":"2405.05190","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-a-formal-creativity-theory","title":"Towards a Formal Creativity Theory: Preliminary results in Novelty and Transformativeness","date":"2024-05-03","arxiv_id":"2405.02148","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-review-of-barren-plateaus-in-variational","title":"Barren Plateaus in Variational Quantum Computing","date":"2024-05-01","arxiv_id":"2405.00781","repositories_listed":0,"syntology":null},{"url":null,"slug":"error-exponent-in-agnostic-pac-learning","title":"Error Exponent in Agnostic PAC Learning","date":"2024-05-01","arxiv_id":"2405.00792","repositories_listed":0,"syntology":null},{"url":null,"slug":"research-on-geometric-figure-classification","title":"Research on geometric figure classification algorithm based on Deep Learning","date":"2024-04-25","arxiv_id":"2404.16561","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-error-bounds-for-learning","title":"Generalization Error Bounds for Learning under Censored Feedback","date":"2024-04-14","arxiv_id":"2404.09247","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-neural-network-account-to-kant-s","title":"A neural network account to Kant's philosophical aesthetics","date":"2024-04-12","arxiv_id":"2404.12395","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-learnability-of-out-of-distribution","title":"On the Learnability of Out-of-distribution Detection","date":"2024-04-07","arxiv_id":"2404.04865","repositories_listed":0,"syntology":null},{"url":null,"slug":"statistical-mechanics-and-artificial-neural","title":"Statistical Mechanics and Artificial Neural Networks: Principles, Models, and Applications","date":"2024-04-05","arxiv_id":"2405.10957","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-error-analysis-for-sparse","title":"Generalization Error Analysis for Sparse Mixture-of-Experts: A Preliminary Study","date":"2024-03-26","arxiv_id":"2403.17404","repositories_listed":0,"syntology":null},{"url":null,"slug":"coda-a-cost-efficient-test-time-domain","title":"CODA: A COst-efficient Test-time Domain Adaptation Mechanism for HAR","date":"2024-03-22","arxiv_id":"2403.14922","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-nas-under-adversarial-training","title":"Robust NAS under adversarial training: benchmark, theory, and beyond","date":"2024-03-19","arxiv_id":"2403.13134","repositories_listed":0,"syntology":null},{"url":null,"slug":"conformal-predictions-for-probabilistically","title":"Conformal Predictions for Probabilistically Robust Scalable Machine Learning Classification","date":"2024-03-15","arxiv_id":"2403.10368","repositories_listed":0,"syntology":null},{"url":null,"slug":"majority-of-three-the-simplest-optimal","title":"Majority-of-Three: The Simplest Optimal Learner?","date":"2024-03-12","arxiv_id":"2403.08831","repositories_listed":0,"syntology":null},{"url":null,"slug":"disentangling-resilience-from-robustness","title":"Disentangling Resilience from Robustness: Contextual Dualism, Interactionism, and Game-Theoretic Paradigms","date":"2024-03-10","arxiv_id":"2403.06299","repositories_listed":0,"syntology":null},{"url":null,"slug":"differential-privacy-of-noisy-s-gd-under","title":"Privacy of SGD under Gaussian or Heavy-Tailed Noise: Guarantees without Gradient Clipping","date":"2024-03-04","arxiv_id":"2403.02051","repositories_listed":0,"syntology":null},{"url":null,"slug":"lotka-volterra-model-with-mutations-and","title":"Lotka-Volterra Model with Mutations and Generative Adversarial Networks","date":"2024-02-29","arxiv_id":"2402.19035","repositories_listed":0,"syntology":null},{"url":null,"slug":"conformal-shield-a-novel-adversarial-attack","title":"Conformal Shield: A Novel Adversarial Attack Detection Framework for Automatic Modulation Classification","date":"2024-02-27","arxiv_id":"2402.17450","repositories_listed":0,"syntology":null},{"url":null,"slug":"shapley-value-based-multi-agent-reinforcement","title":"Shapley Value Based Multi-Agent Reinforcement Learning: Theory, Method and Its Application to Energy Network","date":"2024-02-23","arxiv_id":"2402.15324","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-time-series-forecasting-with","title":"Adaptive time series forecasting with markovian variance switching","date":"2024-02-22","arxiv_id":"2402.14684","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalising-realisability-in-statistical","title":"Generalising realisability in statistical learning theory under epistemic uncertainty","date":"2024-02-22","arxiv_id":"2402.14759","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-unified-framework-of-non-local-parametric","title":"A unified framework of non-local parametric methods for image denoising","date":"2024-02-21","arxiv_id":"2402.13816","repositories_listed":0,"syntology":null},{"url":null,"slug":"rigor-with-machine-learning-from-field-theory","title":"Rigor with Machine Learning from Field Theory to the Poincaré Conjecture","date":"2024-02-20","arxiv_id":"2402.13321","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-dimension-of-self-directed-learning","title":"The Dimension of Self-Directed Learning","date":"2024-02-20","arxiv_id":"2402.13400","repositories_listed":0,"syntology":null},{"url":null,"slug":"learnability-is-a-compact-property","title":"Transductive Learning Is Compact","date":"2024-02-15","arxiv_id":"2402.10360","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-complexity-of-sequential-prediction-in","title":"The Complexity of Sequential Prediction in Dynamical Systems","date":"2024-02-09","arxiv_id":"2402.06614","repositories_listed":0,"syntology":null},{"url":null,"slug":"sharp-rates-in-dependent-learning-theory","title":"Sharp Rates in Dependent Learning Theory: Avoiding Sample Size Deflation for the Square Loss","date":"2024-02-08","arxiv_id":"2402.05928","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-call-for-embodied-ai","title":"A call for embodied AI","date":"2024-02-06","arxiv_id":"2402.03824","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-what-affects-generalization-gap","title":"Understanding What Affects the Generalization Gap in Visual Reinforcement Learning: Theory and Empirical Evidence","date":"2024-02-05","arxiv_id":"2402.02701","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-understand-identifying","title":"Learning to Understand: Identifying Interactions via the Möbius Transform","date":"2024-02-04","arxiv_id":"2402.02631","repositories_listed":0,"syntology":null},{"url":null,"slug":"credal-learning-theory","title":"Credal Learning Theory","date":"2024-02-01","arxiv_id":"2402.00957","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-twin-peaks-of-learning-neural-networks","title":"The twin peaks of learning neural networks","date":"2024-01-23","arxiv_id":"2401.12610","repositories_listed":0,"syntology":null},{"url":null,"slug":"hallucination-is-inevitable-an-innate","title":"Hallucination is Inevitable: An Innate Limitation of Large Language Models","date":"2024-01-22","arxiv_id":"2401.11817","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantum-machine-learning-from-nisq-to-fault","title":"A comprehensive review of Quantum Machine Learning: from NISQ to Fault Tolerance","date":"2024-01-21","arxiv_id":"2401.11351","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-on-statistical-theory-of-deep","title":"A Survey on Statistical Theory of Deep Learning: Approximation, Training Dynamics, and Generative Models","date":"2024-01-14","arxiv_id":"2401.07187","repositories_listed":0,"syntology":null}],"record_sha256":"9b12b308220a744dd488d79552b9b50ac3a826f9347e23d652373f3826c1d9d3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}