{"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/2","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":2,"pages_in_order":9,"rows_per_page":100,"rows":[101,200],"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","next":"/task/learning-theory/papers/3","papers":[{"url":"/paper/learning-curves-for-sgd-on-structured","slug":"learning-curves-for-sgd-on-structured","title":"Learning Curves for SGD on Structured Features","date":"2021-06-04","arxiv_id":"2106.02713","repositories_listed":1,"syntology":null},{"url":"/paper/optimization-variance-exploring-1","slug":"optimization-variance-exploring-1","title":"Optimization Variance: Exploring Generalization Properties of DNNs","date":"2021-06-03","arxiv_id":"2106.01714","repositories_listed":1,"syntology":null},{"url":"/paper/minimax-kernel-machine-learning-for-a-class","slug":"minimax-kernel-machine-learning-for-a-class","title":"Minimax Kernel Machine Learning for a Class of Doubly Robust Functionals with Application to Proximal Causal Inference","date":"2021-04-07","arxiv_id":"2104.02929","repositories_listed":1,"syntology":null},{"url":"/paper/consistent-sparse-deep-learning-theory-and","slug":"consistent-sparse-deep-learning-theory-and","title":"Consistent Sparse Deep Learning: Theory and Computation","date":"2021-02-25","arxiv_id":"2102.13229","repositories_listed":1,"syntology":null},{"url":"/paper/lessons-from-chasing-few-shot-learning","slug":"lessons-from-chasing-few-shot-learning","title":"Two Sides of Meta-Learning Evaluation: In vs. Out of Distribution","date":"2021-02-23","arxiv_id":"2102.11503","repositories_listed":1,"syntology":null},{"url":"/paper/geostatistical-learning-challenges-and","slug":"geostatistical-learning-challenges-and","title":"Geostatistical Learning: Challenges and Opportunities","date":"2021-02-17","arxiv_id":"2102.08791","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-of-label-noise-representation","slug":"a-survey-of-label-noise-representation","title":"A Survey of Label-noise Representation Learning: Past, Present and Future","date":"2020-11-09","arxiv_id":"2011.04406","repositories_listed":1,"syntology":null},{"url":"/paper/deep-active-learning-with-augmentation-based","slug":"deep-active-learning-with-augmentation-based","title":"Deep Active Learning with Augmentation-based Consistency Estimation","date":"2020-11-05","arxiv_id":"2011.02666","repositories_listed":1,"syntology":null},{"url":"/paper/kernel-smoothing-mean-shift-and-their","slug":"kernel-smoothing-mean-shift-and-their","title":"Kernel Smoothing, Mean Shift, and Their Learning Theory with Directional Data","date":"2020-10-23","arxiv_id":"2010.13523","repositories_listed":1,"syntology":null},{"url":"/paper/deep-learning-is-singular-and-that-s-good-1","slug":"deep-learning-is-singular-and-that-s-good-1","title":"Deep Learning is Singular, and That's Good","date":"2020-10-22","arxiv_id":"2010.11560","repositories_listed":1,"syntology":{"n":17,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 1 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/deep-learning-is-singular-and-that-s-good-1#ran","syntology_url":"https://syntology.ai/paper/2010.11560","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.11560"}},"official":{"repos":["susanwe/RLCT"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/putting-theory-to-work-from-learning-bounds-1","slug":"putting-theory-to-work-from-learning-bounds-1","title":"Improving Few-Shot Learning through Multi-task Representation Learning Theory","date":"2020-10-05","arxiv_id":"2010.01992","repositories_listed":1,"syntology":null},{"url":"/paper/a-principle-of-least-action-for-the-training","slug":"a-principle-of-least-action-for-the-training","title":"A Principle of Least Action for the Training of Neural Networks","date":"2020-09-17","arxiv_id":"2009.08372","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/a-principle-of-least-action-for-the-training#ran","syntology_url":"https://syntology.ai/paper/2009.08372","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.08372"}},"official":{"repos":["skander-karkar/LAP"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-with-rare-data-using-active","slug":"learning-with-rare-data-using-active","title":"Active Importance Sampling for Variational Objectives Dominated by Rare Events: Consequences for Optimization and Generalization","date":"2020-08-11","arxiv_id":"2008.06334","repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-complexity-and-the-bias-variance","slug":"revisiting-complexity-and-the-bias-variance","title":"Revisiting minimum description length complexity in overparameterized models","date":"2020-06-17","arxiv_id":"2006.10189","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/revisiting-complexity-and-the-bias-variance#ran","syntology_url":"https://syntology.ai/paper/2006.10189","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.10189"}},"official":{"repos":["csinva/mdl-complexity"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/optimization-and-generalization-analysis-of","slug":"optimization-and-generalization-analysis-of","title":"Optimization and Generalization Analysis of Transduction through Gradient Boosting and Application to Multi-scale Graph Neural Networks","date":"2020-06-15","arxiv_id":"2006.08550","repositories_listed":1,"syntology":null},{"url":"/paper/enhanced-pid-adaptive-feedforward-rbf-neural","slug":"enhanced-pid-adaptive-feedforward-rbf-neural","title":"Adaptive Feedforward Neural Network Control with an Optimized Hidden Node Distribution","date":"2020-05-23","arxiv_id":"2005.11501","repositories_listed":1,"syntology":null},{"url":"/paper/rethink-the-connections-among-generalization","slug":"rethink-the-connections-among-generalization","title":"Rethink the Connections among Generalization, Memorization and the Spectral Bias of DNNs","date":"2020-04-29","arxiv_id":"2004.13954","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/rethink-the-connections-among-generalization#ran","syntology_url":"https://syntology.ai/paper/2004.13954","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.13954"}},"official":{"repos":["ZhangXiao96/RethinkSpectralBias"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-charme-models-with-deep-neural","slug":"learning-charme-models-with-deep-neural","title":"Learning CHARME models with neural networks","date":"2020-02-08","arxiv_id":"2002.03237","repositories_listed":1,"syntology":null},{"url":"/paper/restarted-bayesian-online-change-point","slug":"restarted-bayesian-online-change-point","title":"Restarted Bayesian Online Change-point Detector achieves Optimal Detection Delay","date":"2020-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/tentaclenet-a-pseudo-ensemble-template-for","slug":"tentaclenet-a-pseudo-ensemble-template-for","title":"TentacleNet: A Pseudo-Ensemble Template for Accurate Binary Convolutional Neural Networks","date":"2019-12-20","arxiv_id":"1912.10103","repositories_listed":1,"syntology":null},{"url":"/paper/-net-systematic-evaluation-of-iterative-deep","slug":"-net-systematic-evaluation-of-iterative-deep","title":"$Σ$-net: Systematic Evaluation of Iterative Deep Neural Networks for Fast Parallel MR Image Reconstruction","date":"2019-12-18","arxiv_id":"1912.09278","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":8,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 1 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/-net-systematic-evaluation-of-iterative-deep#ran","syntology_url":"https://syntology.ai/paper/1912.09278","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.09278"}},"official":{"repos":["khammernik/sigmanet"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/information-theoretic-local-minima-1","slug":"information-theoretic-local-minima-1","title":"Information-Theoretic Local Minima Characterization and Regularization","date":"2019-11-19","arxiv_id":"1911.08192","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/information-theoretic-local-minima-1#ran","syntology_url":"https://syntology.ai/paper/1911.08192","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.08192"}},"official":{"repos":["SeanJia/InfoMCR"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/truth-or-backpropaganda-an-empirical-1","slug":"truth-or-backpropaganda-an-empirical-1","title":"Truth or Backpropaganda? An Empirical Investigation of Deep Learning Theory","date":"2019-10-01","arxiv_id":"1910.00359","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/truth-or-backpropaganda-an-empirical-1#ran","syntology_url":"https://syntology.ai/paper/1910.00359","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.00359"}},"official":{"repos":["goldblum/TruthOrBackpropaganda"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-learning-theory-review-an-optimal","slug":"deep-learning-theory-review-an-optimal","title":"Deep Learning Theory Review: An Optimal Control and Dynamical Systems Perspective","date":"2019-08-28","arxiv_id":"1908.10920","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/deep-learning-theory-review-an-optimal#ran","syntology_url":"https://syntology.ai/paper/1908.10920","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.10920"}},"official":{"repos":["ghliu/mean-field-fcdnn"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/causal-regularization-1","slug":"causal-regularization-1","title":"Causal Regularization","date":"2019-06-28","arxiv_id":"1906.12179","repositories_listed":1,"syntology":null},{"url":"/paper/is-deeper-better-only-when-shallow-is-good","slug":"is-deeper-better-only-when-shallow-is-good","title":"Is Deeper Better only when Shallow is Good?","date":"2019-03-08","arxiv_id":"1903.03488","repositories_listed":1,"syntology":null},{"url":"/paper/improving-generalization-of-deep-networks-for","slug":"improving-generalization-of-deep-networks-for","title":"Improving Generalization of Deep Networks for Inverse Reconstruction of Image Sequences","date":"2019-03-05","arxiv_id":"1903.02948","repositories_listed":1,"syntology":null},{"url":"/paper/practical-methods-for-graph-two-sample","slug":"practical-methods-for-graph-two-sample","title":"Practical methods for graph two-sample testing","date":"2018-11-30","arxiv_id":"1811.12752","repositories_listed":1,"syntology":null},{"url":"/paper/the-swag-algorithm-a-mathematical-approach","slug":"the-swag-algorithm-a-mathematical-approach","title":"The SWAG Algorithm; a Mathematical Approach that Outperforms Traditional Deep Learning. Theory and Implementation","date":"2018-11-28","arxiv_id":"1811.11813","repositories_listed":1,"syntology":null},{"url":"/paper/a-bayesian-perspective-of-statistical-machine","slug":"a-bayesian-perspective-of-statistical-machine","title":"A Bayesian Perspective of Statistical Machine Learning for Big Data","date":"2018-11-09","arxiv_id":"1811.04788","repositories_listed":1,"syntology":null},{"url":"/paper/a-tour-of-reinforcement-learning-the-view","slug":"a-tour-of-reinforcement-learning-the-view","title":"A Tour of Reinforcement Learning: The View from Continuous Control","date":"2018-06-25","arxiv_id":"1806.09460","repositories_listed":1,"syntology":null},{"url":"/paper/wikipedia-graph-mining-dynamic-structure-of","slug":"wikipedia-graph-mining-dynamic-structure-of","title":"Wikipedia graph mining: dynamic structure of collective memory","date":"2017-10-01","arxiv_id":"1710.00398","repositories_listed":1,"syntology":null},{"url":"/paper/stealing-machine-learning-models-via","slug":"stealing-machine-learning-models-via","title":"Stealing Machine Learning Models via Prediction APIs","date":"2016-09-09","arxiv_id":"1609.02943","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-training-for-positive-unlabeled","slug":"efficient-training-for-positive-unlabeled","title":"Efficient Training for Positive Unlabeled Learning","date":"2016-08-24","arxiv_id":"1608.06807","repositories_listed":1,"syntology":null},{"url":"/paper/learning-moore-machines-from-input-output","slug":"learning-moore-machines-from-input-output","title":"Learning Moore Machines from Input-Output Traces","date":"2016-05-25","arxiv_id":"1605.07805","repositories_listed":1,"syntology":null},{"url":"/paper/deep-learning-without-poor-local-minima","slug":"deep-learning-without-poor-local-minima","title":"Deep Learning without Poor Local Minima","date":"2016-05-23","arxiv_id":"1605.07110","repositories_listed":1,"syntology":null},{"url":"/paper/network-plasticity-as-bayesian-inference","slug":"network-plasticity-as-bayesian-inference","title":"Network Plasticity as Bayesian Inference","date":"2015-04-20","arxiv_id":"1504.05143","repositories_listed":1,"syntology":null},{"url":"/paper/towards-a-learning-theory-of-cause-effect","slug":"towards-a-learning-theory-of-cause-effect","title":"Towards a Learning Theory of Cause-Effect Inference","date":"2015-02-09","arxiv_id":"1502.02398","repositories_listed":1,"syntology":null},{"url":"/paper/learning-theory-for-distribution-regression","slug":"learning-theory-for-distribution-regression","title":"Learning Theory for Distribution Regression","date":"2014-11-08","arxiv_id":"1411.2066","repositories_listed":1,"syntology":null},{"url":"/paper/robust-optimization-using-machine-learning","slug":"robust-optimization-using-machine-learning","title":"Robust Optimization using Machine Learning for Uncertainty Sets","date":"2014-07-04","arxiv_id":"1407.1097","repositories_listed":1,"syntology":null},{"url":null,"slug":"on-the-hardness-of-bandit-learning","title":"On the Hardness of Bandit Learning","date":"2025-06-17","arxiv_id":"2506.14746","repositories_listed":0,"syntology":null},{"url":null,"slug":"finding-optimal-kernel-size-and-dimension-in","title":"Finding Optimal Kernel Size and Dimension in Convolutional Neural Networks An Architecture Optimization Approach","date":"2025-06-16","arxiv_id":"2506.14846","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-universality-lens-why-even-highly-over","title":"The Universality Lens: Why Even Highly Over-Parametrized Models Learn Well","date":"2025-06-09","arxiv_id":"2506.07661","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-theory-of-decentralized-robust","title":"Learning Theory of Decentralized Robust Kernel-Based Learning Algorithm","date":"2025-06-05","arxiv_id":"2506.05215","repositories_listed":0,"syntology":null},{"url":null,"slug":"what-makes-treatment-effects-identifiable","title":"What Makes Treatment Effects Identifiable? Characterizations and Estimators Beyond Unconfoundedness","date":"2025-06-04","arxiv_id":"2506.04194","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-machine-learning-theory-perspective-on","title":"A Machine Learning Theory Perspective on Strategic Litigation","date":"2025-06-03","arxiv_id":"2506.03411","repositories_listed":0,"syntology":null},{"url":null,"slug":"variational-adaptive-noise-and-dropout","title":"Variational Adaptive Noise and Dropout towards Stable Recurrent Neural Networks","date":"2025-06-02","arxiv_id":"2506.01350","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-dnf-through-generalized-fourier","title":"Learning DNF through Generalized Fourier Representations","date":"2025-06-01","arxiv_id":"2506.01075","repositories_listed":0,"syntology":null},{"url":null,"slug":"distribution-free-m-estimation","title":"Distribution free M-estimation","date":"2025-05-28","arxiv_id":"2505.22807","repositories_listed":0,"syntology":null},{"url":null,"slug":"attribute-efficient-pac-learning-of-sparse","title":"Attribute-Efficient PAC Learning of Sparse Halfspaces with Constant Malicious Noise Rate","date":"2025-05-27","arxiv_id":"2505.21430","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-driven-breakthroughs-and-future","title":"Data-Driven Breakthroughs and Future Directions in AI Infrastructure: A Comprehensive Review","date":"2025-05-22","arxiv_id":"2505.16771","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-asymptotic-equation-linking-waic-and-wbic","title":"An Asymptotic Equation Linking WAIC and WBIC in Singular Models","date":"2025-05-20","arxiv_id":"2505.13902","repositories_listed":0,"syntology":null},{"url":null,"slug":"information-science-principles-of-machine","title":"Information Science Principles of Machine Learning: A Causal Chain Meta-Framework Based on Formalized Information Mapping","date":"2025-05-19","arxiv_id":"2505.13182","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-guarantee-of-reward-modeling-using","title":"Learning Guarantee of Reward Modeling Using Deep Neural Networks","date":"2025-05-10","arxiv_id":"2505.06601","repositories_listed":0,"syntology":null},{"url":null,"slug":"new-statistical-and-computational-results-for","title":"New Statistical and Computational Results for Learning Junta Distributions","date":"2025-05-09","arxiv_id":"2505.05819","repositories_listed":0,"syntology":null},{"url":null,"slug":"lower-bounds-for-greedy-teaching-set","title":"Lower Bounds for Greedy Teaching Set Constructions","date":"2025-05-06","arxiv_id":"2505.03223","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-robust-and-generalizable-gerchberg","title":"Towards Robust and Generalizable Gerchberg Saxton based Physics Inspired Neural Networks for Computer Generated Holography: A Sensitivity Analysis Framework","date":"2025-04-30","arxiv_id":"2505.00220","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-selection-for-erms","title":"Data Selection for ERMs","date":"2025-04-20","arxiv_id":"2504.14572","repositories_listed":0,"syntology":null},{"url":null,"slug":"erzeugunsgrad-vc-dimension-and-neural","title":"Erzeugunsgrad, VC-Dimension and Neural Networks with rational activation function","date":"2025-04-15","arxiv_id":"2504.11345","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-bounds-in-hybrid-quantum","title":"Generalization Bounds in Hybrid Quantum-Classical Machine Learning Models","date":"2025-04-11","arxiv_id":"2504.08456","repositories_listed":0,"syntology":null},{"url":null,"slug":"programs-as-singularities","title":"Programs as Singularities","date":"2025-04-10","arxiv_id":"2504.08075","repositories_listed":0,"syntology":null},{"url":null,"slug":"relaxing-the-markov-requirements-on","title":"A Framework of decision-relevant observability: Reinforcement Learning converges under relative ignorability","date":"2025-04-10","arxiv_id":"2504.07722","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-erase-quantum-states","title":"Learning to erase quantum states: thermodynamic implications of quantum learning theory","date":"2025-04-09","arxiv_id":"2504.07341","repositories_listed":0,"syntology":null},{"url":null,"slug":"ddpm-score-matching-and-distribution-learning","title":"DDPM Score Matching and Distribution Learning","date":"2025-04-07","arxiv_id":"2504.05161","repositories_listed":0,"syntology":null},{"url":null,"slug":"resurrecting-socrates-in-the-age-of-ai-a","title":"Resurrecting Socrates in the Age of AI: A Study Protocol for Evaluating a Socratic Tutor to Support Research Question Development in Higher Education","date":"2025-04-05","arxiv_id":"2504.06294","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-nets-as-hamiltonians","title":"Deep Neural Nets as Hamiltonians","date":"2025-03-31","arxiv_id":"2503.23982","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantum-advantage-for-learning-shallow-neural","title":"Quantum advantage for learning shallow neural networks with natural data distributions","date":"2025-03-26","arxiv_id":"2503.20879","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantum-neural-network-restatement-of-markov","title":"Quantum Neural Network Restatement of Markov Jump Process","date":"2025-03-26","arxiv_id":"2503.20742","repositories_listed":0,"syntology":null},{"url":null,"slug":"reservoir-computing-with-a-single-oscillating","title":"Reservoir Computing with a Single Oscillating Gas Bubble: Emphasizing the Chaotic Regime","date":"2025-03-25","arxiv_id":"2504.07221","repositories_listed":0,"syntology":null},{"url":null,"slug":"borsuk-ulam-and-replicable-learning-of-large","title":"Borsuk-Ulam and Replicable Learning of Large-Margin Halfspaces","date":"2025-03-19","arxiv_id":"2503.15294","repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-gradient-sarsa-routing-with-theoretical","title":"Semi-Gradient SARSA Routing with Theoretical Guarantee on Traffic Stability and Weight Convergence","date":"2025-03-19","arxiv_id":"2503.14927","repositories_listed":0,"syntology":null},{"url":null,"slug":"numerical-and-statistical-analysis-of","title":"Numerical and statistical analysis of NeuralODE with Runge-Kutta time integration","date":"2025-03-13","arxiv_id":"2503.10729","repositories_listed":0,"syntology":null},{"url":null,"slug":"spherical-dimension","title":"Spherical dimension","date":"2025-03-13","arxiv_id":"2503.10240","repositories_listed":0,"syntology":null},{"url":null,"slug":"redefining-fitness-evolution-as-a-dynamic","title":"Redefining Fitness: Evolution as a Dynamic Learning Process","date":"2025-03-12","arxiv_id":"2503.09057","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-and-accurate-estimation-of-1","title":"Efficient and Accurate Estimation of Lipschitz Constants for Hybrid Quantum-Classical Decision Models","date":"2025-03-11","arxiv_id":"2503.07992","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-linear-theory-of-multi-winner-voting","title":"A Linear Theory of Multi-Winner Voting","date":"2025-03-05","arxiv_id":"2503.03082","repositories_listed":0,"syntology":null},{"url":null,"slug":"sustainable-ai-mathematical-foundations-of","title":"Sustainable AI: Mathematical Foundations of Spiking Neural Networks","date":"2025-03-03","arxiv_id":"2503.02013","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-emergence-of-grammar-through","title":"The Emergence of Grammar through Reinforcement Learning","date":"2025-03-03","arxiv_id":"2503.01635","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantum-geometry-insights-in-deep-learning","title":"Quantum Geometry insights in Deep Learning","date":"2025-03-01","arxiv_id":"2503.02655","repositories_listed":0,"syntology":null},{"url":null,"slug":"finite-sample-analysis-of-policy-evaluation","title":"Finite-Sample Analysis of Policy Evaluation for Robust Average Reward Reinforcement Learning","date":"2025-02-24","arxiv_id":"2502.16816","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-blessing-of-reasoning-llm-based","title":"The Blessing of Reasoning: LLM-Based Contrastive Explanations in Black-Box Recommender Systems","date":"2025-02-24","arxiv_id":"2502.16759","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-a-learning-theory-of-representation","title":"Towards a Learning Theory of Representation Alignment","date":"2025-02-19","arxiv_id":"2502.14047","repositories_listed":0,"syntology":null},{"url":null,"slug":"likelihood-ratio-regularized-quantile","title":"Likelihood-Ratio Regularized Quantile Regression: Adapting Conformal Prediction to High-Dimensional Covariate Shifts","date":"2025-02-18","arxiv_id":"2502.13030","repositories_listed":0,"syntology":null},{"url":null,"slug":"scaling-law-for-stochastic-gradient-descent","title":"Scaling Law for Stochastic Gradient Descent in Quadratically Parameterized Linear Regression","date":"2025-02-13","arxiv_id":"2502.09106","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-in-markets-with-heterogeneous-agents","title":"Markets with Heterogeneous Agents: Dynamics and Survival of Bayesian vs. No-Regret Learners","date":"2025-02-12","arxiv_id":"2502.08597","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-theory-for-kernel-bilevel","title":"Learning Theory for Kernel Bilevel Optimization","date":"2025-02-12","arxiv_id":"2502.08457","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-temporal-invariance-in-android","title":"Learning Temporal Invariance in Android Malware Detectors","date":"2025-02-07","arxiv_id":"2502.05098","repositories_listed":0,"syntology":null},{"url":null,"slug":"parameter-symmetry-breaking-and-restoration","title":"Parameter Symmetry Potentially Unifies Deep Learning Theory","date":"2025-02-07","arxiv_id":"2502.05300","repositories_listed":0,"syntology":null},{"url":null,"slug":"immersion-for-ai-immersive-learning-with","title":"Immersion for AI: Immersive Learning with Artificial Intelligence","date":"2025-02-05","arxiv_id":"2502.03504","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-the-integral-quadratic-constraints","title":"Learning the Integral Quadratic Constraints on Plant-Model Mismatch","date":"2025-02-03","arxiv_id":"2502.00976","repositories_listed":0,"syntology":null},{"url":null,"slug":"pac-learning-is-just-bipartite-matching-sort","title":"PAC Learning is just Bipartite Matching (Sort of)","date":"2025-02-02","arxiv_id":"2502.00607","repositories_listed":0,"syntology":null},{"url":null,"slug":"evidence-on-the-regularisation-properties-of","title":"Evidence on the Regularisation Properties of Maximum-Entropy Reinforcement Learning","date":"2025-01-28","arxiv_id":"2501.17115","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-pseudo-dimension-of-contracts","title":"The Pseudo-Dimension of Contracts","date":"2025-01-24","arxiv_id":"2501.14474","repositories_listed":0,"syntology":null},{"url":null,"slug":"singular-leaning-coefficients-and-efficiency","title":"Singular leaning coefficients and efficiency in learning theory","date":"2025-01-22","arxiv_id":"2501.12747","repositories_listed":0,"syntology":null},{"url":null,"slug":"stability-and-generalization-of-quantum","title":"Stability and Generalization of Quantum Neural Networks","date":"2025-01-22","arxiv_id":"2501.12737","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-closer-look-at-the-learnability-of-out-of","title":"A Closer Look at the Learnability of Out-of-Distribution (OOD) Detection","date":"2025-01-15","arxiv_id":"2501.08821","repositories_listed":0,"syntology":null},{"url":null,"slug":"testing-noise-assumptions-of-learning","title":"Testing Noise Assumptions of Learning Algorithms","date":"2025-01-15","arxiv_id":"2501.09189","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-use-of-statistical-learning-theory-for","title":"On the use of Statistical Learning Theory for model selection in Structural Health Monitoring","date":"2025-01-14","arxiv_id":"2501.08050","repositories_listed":0,"syntology":null},{"url":null,"slug":"monotonic-learning-in-the-pac-framework-a-new","title":"Monotonic Learning in the PAC Framework: A New Perspective","date":"2025-01-09","arxiv_id":"2501.05493","repositories_listed":0,"syntology":null},{"url":null,"slug":"practical-machine-learning-is-learning-on","title":"Practical machine learning is learning on small samples","date":"2025-01-03","arxiv_id":"2501.01836","repositories_listed":0,"syntology":null}],"record_sha256":"050171eac3c98d0c44ace5e7bb4d5046b0a5a2d65eed591493eac9d9237ec41b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}