{"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/5","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":5,"pages_in_order":9,"rows_per_page":100,"rows":[401,500],"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/4","next":"/task/learning-theory/papers/6","papers":[{"url":null,"slug":"theoretical-guarantees-for-domain-adaptation","title":"Theoretical Guarantees for Domain Adaptation with Hierarchical Optimal Transport","date":"2022-10-24","arxiv_id":"2210.13331","repositories_listed":0,"syntology":null},{"url":null,"slug":"ms-dc-unext-an-mlp-based-multi-scale-feature","title":"MS-DCANet: A Novel Segmentation Network For Multi-Modality COVID-19 Medical Images","date":"2022-10-22","arxiv_id":"2210.12361","repositories_listed":0,"syntology":null},{"url":null,"slug":"just-mix-once-worst-group-generalization-by","title":"Just Mix Once: Worst-group Generalization by Group Interpolation","date":"2022-10-21","arxiv_id":"2210.12195","repositories_listed":0,"syntology":null},{"url":null,"slug":"robot-learning-theory-of-mind-through-self","title":"Robot Learning Theory of Mind through Self-Observation: Exploiting the Intentions-Beliefs Synergy","date":"2022-10-17","arxiv_id":"2210.09435","repositories_listed":0,"syntology":null},{"url":null,"slug":"evaluated-cmi-bounds-for-meta-learning","title":"Evaluated CMI Bounds for Meta Learning: Tightness and Expressiveness","date":"2022-10-12","arxiv_id":"2210.06511","repositories_listed":0,"syntology":null},{"url":null,"slug":"unlabelled-sample-compression-schemes-for","title":"Unlabelled Sample Compression Schemes for Intersection-Closed Classes and Extremal Classes","date":"2022-10-11","arxiv_id":"2210.05455","repositories_listed":0,"syntology":null},{"url":null,"slug":"do-you-pay-for-privacy-in-online-learning","title":"Do you pay for Privacy in Online learning?","date":"2022-10-10","arxiv_id":"2210.04817","repositories_listed":0,"syntology":null},{"url":null,"slug":"stability-and-generalization-for-markov-chain","title":"Stability and Generalization for Markov Chain Stochastic Gradient Methods","date":"2022-09-16","arxiv_id":"2209.08005","repositories_listed":0,"syntology":null},{"url":"/paper/generalization-properties-of-nas-under","slug":"generalization-properties-of-nas-under","title":"Generalization Properties of NAS under Activation and Skip Connection Search","date":"2022-09-15","arxiv_id":"2209.07238","repositories_listed":0,"syntology":null},{"url":null,"slug":"statistical-learning-theory-for-control-a","title":"Statistical Learning Theory for Control: A Finite Sample Perspective","date":"2022-09-12","arxiv_id":"2209.05423","repositories_listed":0,"syntology":null},{"url":null,"slug":"automatically-score-tissue-images-like-a","title":"Automatically Score Tissue Images Like a Pathologist by Transfer Learning","date":"2022-09-09","arxiv_id":"2209.05954","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-learning-theory-for-quantum-photonic","title":"A learning theory for quantum photonic processors and beyond","date":"2022-09-07","arxiv_id":"2209.03075","repositories_listed":0,"syntology":null},{"url":null,"slug":"moderately-balanced-representation-learning","title":"Moderately-Balanced Representation Learning for Treatment Effects with Orthogonality Information","date":"2022-09-05","arxiv_id":"2209.01956","repositories_listed":0,"syntology":null},{"url":null,"slug":"fine-grained-distribution-dependent-learning","title":"Fine-Grained Distribution-Dependent Learning Curves","date":"2022-08-31","arxiv_id":"2208.14615","repositories_listed":0,"syntology":null},{"url":null,"slug":"representation-learning-based-and","title":"Representation Learning based and Interpretable Reactor System Diagnosis Using Denoising Padded Autoencoder","date":"2022-08-30","arxiv_id":"2208.14319","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-in-multi-objective-machine","title":"Generalization In Multi-Objective Machine Learning","date":"2022-08-29","arxiv_id":"2208.13499","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-non-efficient-pac-learnability-of","title":"On the non-efficient PAC learnability of conjunctive queries","date":"2022-08-22","arxiv_id":"2208.10255","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-generalization-of-learning-algorithms","title":"On the generalization of learning algorithms that do not converge","date":"2022-08-16","arxiv_id":"2208.07951","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-establishing-learning-separations-between","title":"On establishing learning separations between classical and quantum machine learning with classical data","date":"2022-08-12","arxiv_id":"2208.06339","repositories_listed":0,"syntology":null},{"url":null,"slug":"deephider-a-multi-module-and-invisibility","title":"DeepHider: A Covert NLP Watermarking Framework Based on Multi-task Learning","date":"2022-08-09","arxiv_id":"2208.04676","repositories_listed":0,"syntology":null},{"url":null,"slug":"what-can-we-learn-by-predicting-accuracy","title":"What can we Learn by Predicting Accuracy?","date":"2022-08-02","arxiv_id":"2208.01358","repositories_listed":0,"syntology":null},{"url":null,"slug":"v-coder-adaptive-autoencoder-for-semantic","title":"V-Coder: Adaptive AutoEncoder for Semantic Disclosure in Knowledge Graphs","date":"2022-07-22","arxiv_id":"2208.01735","repositories_listed":0,"syntology":null},{"url":null,"slug":"masked-spatial-spectral-autoencoders-are","title":"Masked Spatial-Spectral Autoencoders Are Excellent Hyperspectral Defenders","date":"2022-07-16","arxiv_id":"2207.07803","repositories_listed":0,"syntology":null},{"url":null,"slug":"benign-tempered-or-catastrophic-a-taxonomy-of","title":"Benign, Tempered, or Catastrophic: A Taxonomy of Overfitting","date":"2022-07-14","arxiv_id":"2207.06569","repositories_listed":0,"syntology":null},{"url":null,"slug":"binary-iterative-hard-thresholding-converges","title":"Binary Iterative Hard Thresholding Converges with Optimal Number of Measurements for 1-Bit Compressed Sensing","date":"2022-07-07","arxiv_id":"2207.03427","repositories_listed":0,"syntology":null},{"url":null,"slug":"q-learning-in-continuous-time","title":"q-Learning in Continuous Time","date":"2022-07-02","arxiv_id":"2207.00713","repositories_listed":0,"syntology":null},{"url":null,"slug":"multimodal-large-language-models-for","title":"Multimodal large language models for inclusive collaboration learning tasks","date":"2022-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-benign-overfitting-in-nested","title":"Understanding Benign Overfitting in Gradient-Based Meta Learning","date":"2022-06-27","arxiv_id":"2206.13482","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-robustness-is-at-odds-with-lazy","title":"Adversarial Robustness is at Odds with Lazy Training","date":"2022-06-18","arxiv_id":"2207.00411","repositories_listed":0,"syntology":null},{"url":null,"slug":"machine-learning-is-abduction-inference","title":"Theory of Machine Learning with Limited Data","date":"2022-06-15","arxiv_id":"2206.07586","repositories_listed":0,"syntology":null},{"url":null,"slug":"scientific-inference-with-interpretable","title":"Scientific Inference With Interpretable Machine Learning: Analyzing Models to Learn About Real-World Phenomena","date":"2022-06-11","arxiv_id":"2206.05487","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-frequency-band-selection-for","title":"Adaptive Frequency Band Selection for Accurate and Fast Positioning utilizing SOPs","date":"2022-06-09","arxiv_id":"2206.04312","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-in-observable-pomdps-without","title":"Learning in Observable POMDPs, without Computationally Intractable Oracles","date":"2022-06-07","arxiv_id":"2206.03446","repositories_listed":0,"syntology":null},{"url":null,"slug":"bandit-theory-and-thompson-sampling-guided","title":"Bandit Theory and Thompson Sampling-Guided Directed Evolution for Sequence Optimization","date":"2022-06-05","arxiv_id":"2206.02092","repositories_listed":0,"syntology":null},{"url":null,"slug":"uncertainty-estimation-in-machine-learning","title":"Uncertainty Estimation in Machine Learning","date":"2022-06-03","arxiv_id":"2206.01749","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-bounds-for-gradient-methods","title":"Generalization Bounds for Gradient Methods via Discrete and Continuous Prior","date":"2022-05-27","arxiv_id":"2205.13799","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-distributions-by-generative","title":"Learning Distributions by Generative Adversarial Networks: Approximation and Generalization","date":"2022-05-25","arxiv_id":"2205.12601","repositories_listed":0,"syntology":null},{"url":null,"slug":"throwing-away-data-improves-worst-class-error","title":"Why does Throwing Away Data Improve Worst-Group Error?","date":"2022-05-23","arxiv_id":"2205.11672","repositories_listed":0,"syntology":null},{"url":null,"slug":"survey-on-fair-reinforcement-learning-theory","title":"Survey on Fair Reinforcement Learning: Theory and Practice","date":"2022-05-20","arxiv_id":"2205.10032","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-note-on-the-chernoff-bound-for-random","title":"A Note on the Chernoff Bound for Random Variables in the Unit Interval","date":"2022-05-15","arxiv_id":"2205.07880","repositories_listed":0,"syntology":null},{"url":null,"slug":"detailed-balanced-chemical-reaction-networks","title":"Detailed Balanced Chemical Reaction Networks as Generalized Boltzmann Machines","date":"2022-05-12","arxiv_id":"2205.06313","repositories_listed":0,"syntology":null},{"url":null,"slug":"intrinsic-gradient-compression-for-scalable","title":"Intrinsic Gradient Compression for Scalable and Efficient Federated Learning","date":"2022-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-theory-of-mind-via-dynamic-traits","title":"Learning Theory of Mind via Dynamic Traits Attribution","date":"2022-04-17","arxiv_id":"2204.09047","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-from-many-trajectories","title":"Learning from many trajectories","date":"2022-03-31","arxiv_id":"2203.17193","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-super-polynomial-lower-bound-for-learning","title":"Tight Bounds on the Hardness of Learning Simple Nonparametric Mixtures","date":"2022-03-28","arxiv_id":"2203.15150","repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-distillation-bad-models-can-be-good","title":"Knowledge Distillation: Bad Models Can Be Good Role Models","date":"2022-03-28","arxiv_id":"2203.14649","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-bounds-for-learning-under","title":"Generalization bounds for learning under graph-dependence: A survey","date":"2022-03-25","arxiv_id":"2203.13534","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-losses-for-strategic-classification","title":"Learning Losses for Strategic Classification","date":"2022-03-25","arxiv_id":"2203.13421","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-rejection-function-meets-character","title":"Optimal Rejection Function Meets Character Recognition Tasks","date":"2022-03-17","arxiv_id":"2203.09151","repositories_listed":0,"syntology":null},{"url":null,"slug":"approximability-and-generalisation","title":"Approximability and Generalisation","date":"2022-03-15","arxiv_id":"2203.07989","repositories_listed":0,"syntology":null},{"url":null,"slug":"rate-distortion-theoretic-generalization","title":"Rate-Distortion Theoretic Generalization Bounds for Stochastic Learning Algorithms","date":"2022-03-04","arxiv_id":"2203.02474","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-characterization-of-multiclass-learnability","title":"A Characterization of Multiclass Learnability","date":"2022-03-03","arxiv_id":"2203.01550","repositories_listed":0,"syntology":null},{"url":null,"slug":"contrasting-random-and-learned-features-in","title":"Contrasting random and learned features in deep Bayesian linear regression","date":"2022-03-01","arxiv_id":"2203.00573","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalized-label-shift-correction-via","title":"Generalized Label Shift Correction via Minimum Uncertainty Principle: Theory and Algorithm","date":"2022-02-26","arxiv_id":"2202.13043","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-unsupervised-domain-adaptation-via","title":"Towards Unsupervised Domain Adaptation via Domain-Transformer","date":"2022-02-24","arxiv_id":"2202.13777","repositories_listed":0,"syntology":null},{"url":null,"slug":"information-theoretic-analysis-of-minimax","title":"Information-Theoretic Analysis of Minimax Excess Risk","date":"2022-02-15","arxiv_id":"2202.07537","repositories_listed":0,"syntology":null},{"url":null,"slug":"games-of-artificial-intelligence-a-continuous","title":"Artificial Intelligence and Spontaneous Collusion","date":"2022-02-12","arxiv_id":"2202.05946","repositories_listed":0,"syntology":null},{"url":null,"slug":"minimax-regret-optimization-for-robust","title":"Minimax Regret Optimization for Robust Machine Learning under Distribution Shift","date":"2022-02-11","arxiv_id":"2202.05436","repositories_listed":0,"syntology":null},{"url":null,"slug":"trust-in-ai-interpretability-is-not-necessary","title":"Trust in AI: Interpretability is not necessary or sufficient, while black-box interaction is necessary and sufficient","date":"2022-02-10","arxiv_id":"2202.05302","repositories_listed":0,"syntology":null},{"url":null,"slug":"smoothed-online-learning-is-as-easy-as","title":"Smoothed Online Learning is as Easy as Statistical Learning","date":"2022-02-09","arxiv_id":"2202.04690","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-no-free-lunch-theorems-of-supervised","title":"The no-free-lunch theorems of supervised learning","date":"2022-02-09","arxiv_id":"2202.04513","repositories_listed":0,"syntology":null},{"url":null,"slug":"interplay-between-depth-of-neural-networks","title":"Interplay between depth of neural networks and locality of target functions","date":"2022-01-28","arxiv_id":"2201.12082","repositories_listed":0,"syntology":null},{"url":null,"slug":"limitation-of-characterizing-implicit","title":"Limitation of Characterizing Implicit Regularization by Data-independent Functions","date":"2022-01-28","arxiv_id":"2201.12198","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-deterministic-hydrodynamic-equations","title":"Learning deterministic hydrodynamic equations from stochastic active particle dynamics","date":"2022-01-21","arxiv_id":"2201.08623","repositories_listed":0,"syntology":null},{"url":null,"slug":"universal-online-learning-with-unbounded","title":"Universal Online Learning with Unbounded Losses: Memory Is All You Need","date":"2022-01-21","arxiv_id":"2201.08903","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-learning-optimization-theory-trajectory","title":"Deep Learning Optimization Theory - Trajectory Analysis of Gradient Descent","date":"2022-01-17","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-few-shot-multi-task","title":"Understanding Few-Shot Multi-Task Representation Learning Theory","date":"2022-01-17","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"universal-online-learning-an-optimistically","title":"Universal Online Learning: an Optimistically Universal Learning Rule","date":"2022-01-16","arxiv_id":"2201.05947","repositories_listed":0,"syntology":null},{"url":null,"slug":"formal-models-of-memory-based-on-temporally","title":"Formal models of memory based on temporally-varying representations","date":"2022-01-05","arxiv_id":"2201.01796","repositories_listed":0,"syntology":null},{"url":null,"slug":"neurashed-a-phenomenological-model-for","title":"Envisioning Future Deep Learning Theories: Some Basic Concepts and Characteristics","date":"2021-12-17","arxiv_id":"2112.09741","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-cognitively-driven-weighted-entropy-model","title":"A cognitively driven weighted-entropy model for embedding semantic categories in hyperbolic geometry","date":"2021-12-13","arxiv_id":"2112.06876","repositories_listed":0,"syntology":null},{"url":null,"slug":"regularized-modal-regression-on-markov","title":"Regularized Modal Regression on Markov-dependent Observations: A Theoretical Assessment","date":"2021-12-09","arxiv_id":"2112.04779","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-theory-can-sometimes-explain-1","title":"Learning Theory Can (Sometimes) Explain Generalisation in Graph Neural Networks","date":"2021-12-07","arxiv_id":"2112.03968","repositories_listed":0,"syntology":null},{"url":null,"slug":"intrinisic-gradient-compression-for-federated","title":"Intrinisic Gradient Compression for Federated Learning","date":"2021-12-05","arxiv_id":"2112.02656","repositories_listed":0,"syntology":null},{"url":null,"slug":"black-box-tests-for-algorithmic-stability","title":"Black-box tests for algorithmic stability","date":"2021-11-30","arxiv_id":"2111.15546","repositories_listed":0,"syntology":null},{"url":null,"slug":"mesarovician-abstract-learning-systems","title":"Mesarovician Abstract Learning Systems","date":"2021-11-29","arxiv_id":"2111.14766","repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-fine-tuning-by-leveraging-pre-1","title":"Improved Fine-Tuning by Better Leveraging Pre-Training Data","date":"2021-11-24","arxiv_id":"2111.12292","repositories_listed":0,"syntology":null},{"url":null,"slug":"uniform-brackets-containers-and-combinatorial","title":"Uniform Brackets, Containers, and Combinatorial Macbeath Regions","date":"2021-11-19","arxiv_id":"2111.10048","repositories_listed":0,"syntology":null},{"url":null,"slug":"realizable-learning-is-all-you-need","title":"Realizable Learning is All You Need","date":"2021-11-08","arxiv_id":"2111.04746","repositories_listed":0,"syntology":null},{"url":null,"slug":"provably-efficient-succinct-and-precise","title":"Provably efficient, succinct, and precise explanations","date":"2021-11-01","arxiv_id":"2111.01576","repositories_listed":0,"syntology":null},{"url":null,"slug":"labeled-sample-compression-schemes-for","title":"Labeled sample compression schemes for complexes of oriented matroids","date":"2021-10-28","arxiv_id":"2110.15168","repositories_listed":0,"syntology":null},{"url":null,"slug":"user-friendly-introduction-to-pac-bayes","title":"User-friendly introduction to PAC-Bayes bounds","date":"2021-10-21","arxiv_id":"2110.11216","repositories_listed":0,"syntology":null},{"url":null,"slug":"provable-hierarchy-based-meta-reinforcement-1","title":"Provable Hierarchy-Based Meta-Reinforcement Learning","date":"2021-10-18","arxiv_id":"2110.09507","repositories_listed":0,"syntology":null},{"url":null,"slug":"explaining-generalization-in-deep-learning","title":"Explaining generalization in deep learning: progress and fundamental limits","date":"2021-10-17","arxiv_id":"2110.08922","repositories_listed":0,"syntology":null},{"url":null,"slug":"synthesizing-machine-learning-programs-with","title":"Synthesizing Machine Learning Programs with PAC Guarantees via Statistical Sketching","date":"2021-10-11","arxiv_id":"2110.05390","repositories_listed":0,"syntology":null},{"url":null,"slug":"i-do-not-understand-what-i-cannot-define","title":"I Do Not Understand What I Cannot Define: Automatic Question Generation With Pedagogically-Driven Content Selection","date":"2021-10-08","arxiv_id":"2110.04123","repositories_listed":0,"syntology":null},{"url":null,"slug":"pac-synthesis-of-machine-learning-programs","title":"PAC Synthesis of Machine Learning Programs","date":"2021-10-08","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"huber-additive-models-for-non-stationary-time","title":"Huber Additive Models for Non-stationary Time Series Analysis","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-generalization-risk-bounds-for-meta","title":"Improved Generalization Risk Bounds for Meta-Learning with PAC-Bayes-kl Analysis","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-abstain-in-the-presence-of","title":"Learning to Abstain in the Presence of Uninformative Data","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"model-zoo-a-growing-brain-that-learns","title":"Model Zoo: A Growing Brain That Learns Continually","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"reliable-estimation-of-kl-divergence-using-a","title":"Reliable Estimation of KL Divergence using a Discriminator in Reproducing Kernel Hilbert Space","date":"2021-09-29","arxiv_id":"2109.14688","repositories_listed":0,"syntology":null},{"url":"/paper/sequence-approximation-using-feedforward","slug":"sequence-approximation-using-feedforward","title":"Sequence Approximation using Feedforward Spiking Neural Network for Spatiotemporal Learning: Theory and Optimization Methods","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"task-relatedness-based-generalization-bounds","title":"Task Relatedness-Based Generalization Bounds for Meta Learning","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"the-ntk-adversary-an-approach-to-adversarial","title":"The NTK Adversary: An Approach to Adversarial Attacks without any Model Access","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-a-theory-of-out-of-distribution","title":"Towards a theory of out-of-distribution learning","date":"2021-09-29","arxiv_id":"2109.14501","repositories_listed":0,"syntology":null},{"url":null,"slug":"variational-inference-via-resolution-of","title":"Variational Inference via Resolution of Singularities","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"cancer-progression-as-a-learning-process","title":"Cancer Progression as a Learning Process","date":"2021-09-26","arxiv_id":"2109.12511","repositories_listed":0,"syntology":null},{"url":null,"slug":"minimax-rates-for-stit-and-poisson-hyperplane","title":"Minimax Rates for High-Dimensional Random Tessellation Forests","date":"2021-09-22","arxiv_id":"2109.10541","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-generalization-of-quadratic-neural","title":"Robust Generalization of Quadratic Neural Networks via Function Identification","date":"2021-09-22","arxiv_id":"2109.10935","repositories_listed":0,"syntology":null}],"record_sha256":"68eb898a16b1545a610bf267f624b9963760e1f1fcfa6c4530a85c78c0da63c4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}