{"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/7","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":7,"pages_in_order":9,"rows_per_page":100,"rows":[601,700],"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/6","next":"/task/learning-theory/papers/8","papers":[{"url":null,"slug":"too-much-information-kills-information-a","title":"Too Much Information Kills Information: A Clustering Perspective","date":"2020-09-16","arxiv_id":"2009.07417","repositories_listed":0,"syntology":null},{"url":null,"slug":"gradient-based-competitive-learning-theory","title":"Gradient-based Competitive Learning: Theory","date":"2020-09-06","arxiv_id":"2009.02799","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploiting-heterogeneity-in-operational","title":"Exploiting Heterogeneity in Operational Neural Networks by Synaptic Plasticity","date":"2020-08-21","arxiv_id":"2009.08934","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-simple-proof-of-optimal-approximations","title":"Optimal Approximations Made Easy","date":"2020-08-20","arxiv_id":"2008.08970","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-approximation-lower-bound-for-neural","title":"How Powerful are Shallow Neural Networks with Bandlimited Random Weights?","date":"2020-08-19","arxiv_id":"2008.08427","repositories_listed":0,"syntology":null},{"url":null,"slug":"analyzing-upper-bounds-on-mean-absolute","title":"Analyzing Upper Bounds on Mean Absolute Errors for Deep Neural Network Based Vector-to-Vector Regression","date":"2020-08-04","arxiv_id":"2008.05459","repositories_listed":0,"syntology":null},{"url":null,"slug":"verification-of-ml-systems-via","title":"Verification of ML Systems via Reparameterization","date":"2020-07-14","arxiv_id":"2007.06776","repositories_listed":0,"syntology":null},{"url":null,"slug":"reformulation-of-the-no-free-lunch-theorem","title":"Reformulation of the No-Free-Lunch Theorem for Entangled Data Sets","date":"2020-07-09","arxiv_id":"2007.04900","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-revision-of-neural-tangent-kernel-based","title":"A Revision of Neural Tangent Kernel-based Approaches for Neural Networks","date":"2020-07-02","arxiv_id":"2007.00884","repositories_listed":0,"syntology":null},{"url":null,"slug":"associative-memory-in-iterated","title":"Associative Memory in Iterated Overparameterized Sigmoid Autoencoders","date":"2020-06-30","arxiv_id":"2006.16540","repositories_listed":0,"syntology":null},{"url":null,"slug":"nearest-neighbour-based-estimates-of","title":"Nearest Neighbour Based Estimates of Gradients: Sharp Nonasymptotic Bounds and Applications","date":"2020-06-26","arxiv_id":"2006.15043","repositories_listed":0,"syntology":null},{"url":null,"slug":"ensuring-learning-guarantees-on-concept-drift","title":"Ensuring Learning Guarantees on Concept Drift Detection with Statistical Learning Theory","date":"2020-06-24","arxiv_id":"2006.14079","repositories_listed":0,"syntology":null},{"url":null,"slug":"good-linear-classifiers-are-abundant-in-the","title":"Good Classifiers are Abundant in the Interpolating Regime","date":"2020-06-22","arxiv_id":"2006.12625","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-optimal-elimination-algorithm-for-learning","title":"An Optimal Elimination Algorithm for Learning a Best Arm","date":"2020-06-20","arxiv_id":"2006.11647","repositories_listed":0,"syntology":null},{"url":null,"slug":"estimates-on-learning-rates-for-multi-penalty","title":"Estimates on Learning Rates for Multi-Penalty Distribution Regression","date":"2020-06-16","arxiv_id":"2006.09017","repositories_listed":0,"syntology":null},{"url":null,"slug":"toward-theory-of-applied-learning-what-is","title":"Logic of Machine Learning","date":"2020-06-16","arxiv_id":"2006.09500","repositories_listed":0,"syntology":null},{"url":null,"slug":"mixup-training-as-the-complexity-reduction","title":"Why Mixup Improves the Model Performance","date":"2020-06-11","arxiv_id":"2006.06231","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimization-theory-for-relu-neural-networks","title":"Optimization Theory for ReLU Neural Networks Trained with Normalization Layers","date":"2020-06-11","arxiv_id":"2006.06878","repositories_listed":0,"syntology":null},{"url":null,"slug":"sample-efficient-reinforcement-learning-via","title":"Sample Efficient Reinforcement Learning via Low-Rank Matrix Estimation","date":"2020-06-11","arxiv_id":"2006.06135","repositories_listed":0,"syntology":null},{"url":null,"slug":"binary-classification-with-classical","title":"Binary Classification with Classical Instances and Quantum Labels","date":"2020-06-10","arxiv_id":"2006.06005","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-maximum-mutual-information-capacity-of","title":"On the Maximum Mutual Information Capacity of Neural Architectures","date":"2020-06-10","arxiv_id":"2006.06037","repositories_listed":0,"syntology":null},{"url":null,"slug":"uncertain-multi-agent-milps-a-data-driven","title":"Uncertain multi-agent MILPs: A data-driven decentralized solution with probabilistic feasibility guarantees","date":"2020-06-08","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"unique-properties-of-adversarially-trained","title":"Unique properties of adversarially trained linear classifiers on Gaussian data","date":"2020-06-06","arxiv_id":"2006.03873","repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-robust-aggregation-of-sales","title":"Hierarchical robust aggregation of sales forecasts at aggregated levels in e-commerce, based on exponential smoothing and Holt's linear trend method","date":"2020-06-05","arxiv_id":"2006.03373","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-learnability-under-general-stochastic","title":"On Learnability under General Stochastic Processes","date":"2020-05-15","arxiv_id":"2005.07605","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-theory-for-estimation-of-animal","title":"Learning Theory for Estimation of Animal Motion Submanifolds","date":"2020-03-30","arxiv_id":"2003.13811","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-kernel-ridge-regression-with","title":"Distributed Kernel Ridge Regression with Communications","date":"2020-03-27","arxiv_id":"2003.12210","repositories_listed":0,"syntology":null},{"url":null,"slug":"design-unbiased-statistical-learning-in","title":"Design-unbiased statistical learning in survey sampling","date":"2020-03-25","arxiv_id":"2003.11423","repositories_listed":0,"syntology":null},{"url":null,"slug":"risk-analysis-of-divide-and-conquer-erm","title":"Theoretical Analysis of Divide-and-Conquer ERM: Beyond Square Loss and RKHS","date":"2020-03-09","arxiv_id":"2003.03882","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-active-learning-framework-for-constructing","title":"An Active Learning Framework for Constructing High-fidelity Mobility Maps","date":"2020-03-07","arxiv_id":"2003.03517","repositories_listed":0,"syntology":null},{"url":null,"slug":"better-depth-width-trade-offs-for-neural","title":"Better Depth-Width Trade-offs for Neural Networks through the lens of Dynamical Systems","date":"2020-03-02","arxiv_id":"2003.00777","repositories_listed":0,"syntology":null},{"url":null,"slug":"corrupted-multidimensional-binary-search","title":"Contextual Search in the Presence of Adversarial Corruptions","date":"2020-02-26","arxiv_id":"2002.11650","repositories_listed":0,"syntology":null},{"url":null,"slug":"mean-field-analysis-of-two-layer-neural","title":"A Generalized Neural Tangent Kernel Analysis for Two-layer Neural Networks","date":"2020-02-10","arxiv_id":"2002.04026","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-quantum-learning-with-statistical","title":"Statistical Limits of Supervised Quantum Learning","date":"2020-01-28","arxiv_id":"2001.10477","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-learnability-with-computable-learners","title":"On Learnability with Computable Learners","date":"2020-01-28","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"recursion-and-evolution-part-i","title":"Recursion, evolution and conscious self","date":"2020-01-14","arxiv_id":"2001.11825","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-stopping-rule-for-kernel-based","title":"Adaptive Stopping Rule for Kernel-based Gradient Descent Algorithms","date":"2020-01-09","arxiv_id":"2001.02879","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimization-for-deep-learning-theory-and","title":"Optimization for deep learning: theory and algorithms","date":"2019-12-19","arxiv_id":"1912.08957","repositories_listed":0,"syntology":null},{"url":null,"slug":"realization-of-spatial-sparseness-by-deep","title":"Realization of spatial sparseness by deep ReLU nets with massive data","date":"2019-12-16","arxiv_id":"1912.07464","repositories_listed":0,"syntology":null},{"url":null,"slug":"rademacher-complexity-and-spin-glasses-a-link","title":"Rademacher complexity and spin glasses: A link between the replica and statistical theories of learning","date":"2019-12-05","arxiv_id":"1912.02729","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-error-bounds-via-renyi-f","title":"Generalization Error Bounds Via Rényi-, $f$-Divergences and Maximal Leakage","date":"2019-12-01","arxiv_id":"1912.01439","repositories_listed":0,"syntology":null},{"url":null,"slug":"coarse-refinement-dilemma-on-generalization","title":"Coarse-Refinement Dilemma: On Generalization Bounds for Data Clustering","date":"2019-11-13","arxiv_id":"1911.05806","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-shattering-coefficient-of-supervised","title":"On the Complexity of Labeled Datasets","date":"2019-11-13","arxiv_id":"1911.05461","repositories_listed":0,"syntology":null},{"url":null,"slug":"machine-intelligence-at-the-edge-with","title":"Machine Intelligence at the Edge with Learning Centric Power Allocation","date":"2019-11-12","arxiv_id":"1911.04922","repositories_listed":0,"syntology":null},{"url":null,"slug":"one-shot-learning-and-behavioral-eligibility","title":"One-shot learning and behavioral eligibility traces in sequential decision making","date":"2019-11-12","arxiv_id":"1707.04192","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-internal-representations","title":"Learning Internal Representations (PhD Thesis)","date":"2019-11-09","arxiv_id":"1911.03731","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-device-machine-learning-an-algorithms-and","title":"On-Device Machine Learning: An Algorithms and Learning Theory Perspective","date":"2019-11-02","arxiv_id":"1911.00623","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-formal-proof-of-pac-learnability-for","title":"A Formal Proof of PAC Learnability for Decision Stumps","date":"2019-11-01","arxiv_id":"1911.00385","repositories_listed":0,"syntology":null},{"url":null,"slug":"risk-bounds-for-reservoir-computing","title":"Risk bounds for reservoir computing","date":"2019-10-30","arxiv_id":"1910.13886","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-classification-rates-without-standard","title":"Fast classification rates without standard margin assumptions","date":"2019-10-28","arxiv_id":"1910.12756","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-model-predictive-shielding-for-safe","title":"Robust Model Predictive Shielding for Safe Reinforcement Learning with Stochastic Dynamics","date":"2019-10-24","arxiv_id":"1910.10885","repositories_listed":0,"syntology":null},{"url":null,"slug":"compressive-learning-for-semi-parametric","title":"Compressive Learning for Semi-Parametric Models","date":"2019-10-22","arxiv_id":"1910.10024","repositories_listed":0,"syntology":null},{"url":null,"slug":"separable-convolutional-eigen-filters-scef","title":"Building Efficient CNNs Using Depthwise Convolutional Eigen-Filters (DeCEF)","date":"2019-10-21","arxiv_id":"1910.09359","repositories_listed":0,"syntology":null},{"url":null,"slug":"sharper-bounds-for-uniformly-stable","title":"Sharper bounds for uniformly stable algorithms","date":"2019-10-17","arxiv_id":"1910.07833","repositories_listed":0,"syntology":null},{"url":null,"slug":"partial-differential-equation-regularization","title":"Partial differential equation regularization for supervised machine learning","date":"2019-10-03","arxiv_id":"1910.01612","repositories_listed":0,"syntology":null},{"url":null,"slug":"siamese-networks-the-tale-of-two-manifolds","title":"Siamese Networks: The Tale of Two Manifolds","date":"2019-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"compression-based-bound-for-non-compressed-1","title":"Compression based bound for non-compressed network: unified generalization error analysis of large compressible deep neural network","date":"2019-09-25","arxiv_id":"1909.11274","repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-graph-embedding-a-probabilistic","title":"Knowledge Graph Embedding: A Probabilistic Perspective and Generalization Bounds","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"shardnet-one-filter-set-to-rule-them-all","title":"ShardNet: One Filter Set to Rule Them All","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"the-frechet-distance-of-training-and-test","title":"The Frechet Distance of training and test distribution predicts the generalization gap","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-neural-networks-for-choice-analysis-a","title":"Deep Neural Networks for Choice Analysis: A Statistical Learning Theory Perspective","date":"2019-09-16","arxiv_id":"1810.10465","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-hardness-of-robust-classification","title":"On the Hardness of Robust Classification","date":"2019-09-12","arxiv_id":"1909.05822","repositories_listed":0,"syntology":null},{"url":null,"slug":"non-bayesian-social-learning-with-uncertain","title":"Non-Bayesian Social Learning with Uncertain Models","date":"2019-09-09","arxiv_id":"1909.09228","repositories_listed":0,"syntology":null},{"url":null,"slug":"subjectivity-learning-theory-towards","title":"Subjectivity Learning Theory towards Artificial General Intelligence","date":"2019-09-09","arxiv_id":"1909.03798","repositories_listed":0,"syntology":null},{"url":null,"slug":"free-resolutions-of-function-classes-via","title":"Free resolutions of function classes via order complexes","date":"2019-09-05","arxiv_id":"1909.02159","repositories_listed":0,"syntology":null},{"url":null,"slug":"mcdiarmid-type-inequalities-for-graph","title":"McDiarmid-Type Inequalities for Graph-Dependent Variables and Stability Bounds","date":"2019-09-05","arxiv_id":"1909.02330","repositories_listed":0,"syntology":null},{"url":null,"slug":"lecture-notes-selected-topics-on-robust","title":"Lecture Notes: Selected topics on robust statistical learning theory","date":"2019-08-28","arxiv_id":"1908.10761","repositories_listed":0,"syntology":null},{"url":null,"slug":"computational-flight-control-a-domain","title":"A Domain-Knowledge-Aided Deep Reinforcement Learning Approach for Flight Control Design","date":"2019-08-19","arxiv_id":"1908.06884","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-study-in-rashomon-curves-and-volumes-a-new","title":"On the Existence of Simpler Machine Learning Models","date":"2019-08-05","arxiv_id":"1908.01755","repositories_listed":0,"syntology":null},{"url":null,"slug":"domain-generalization-via-multidomain","title":"Domain Generalization via Multidomain Discriminant Analysis","date":"2019-07-25","arxiv_id":"1907.11216","repositories_listed":0,"syntology":null},{"url":null,"slug":"minimal-sample-subspace-learning-theory-and","title":"Minimal Sample Subspace Learning: Theory and Algorithms","date":"2019-07-13","arxiv_id":"1907.06032","repositories_listed":0,"syntology":null},{"url":null,"slug":"symphony-of-high-dimensional-brain","title":"Symphony of high-dimensional brain","date":"2019-06-27","arxiv_id":"1906.12222","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-from-weakly-dependent-data-under","title":"Learning from weakly dependent data under Dobrushin's condition","date":"2019-06-21","arxiv_id":"1906.09247","repositories_listed":0,"syntology":null},{"url":null,"slug":"quadratic-suffices-for-over-parametrization","title":"Quadratic Suffices for Over-parametrization via Matrix Chernoff Bound","date":"2019-06-09","arxiv_id":"1906.03593","repositories_listed":0,"syntology":null},{"url":null,"slug":"190600264","title":"Graph-based Discriminators: Sample Complexity and Expressiveness","date":"2019-06-01","arxiv_id":"1906.00264","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-generalization-gap-in","title":"On the Generalization Gap in Reparameterizable Reinforcement Learning","date":"2019-05-29","arxiv_id":"1905.12654","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-the-behaviour-of-the-empirical","title":"Understanding the Behaviour of the Empirical Cross-Entropy Beyond the Training Distribution","date":"2019-05-28","arxiv_id":"1905.11972","repositories_listed":0,"syntology":null},{"url":null,"slug":"global-minima-of-dnns-the-plenty-pantry","title":"Empirical Risk Minimization in the Interpolating Regime with Application to Neural Network Learning","date":"2019-05-25","arxiv_id":"1905.10686","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-active-learning-label-complexity-vs","title":"Disagreement-based Active Learning in Online Settings","date":"2019-04-19","arxiv_id":"1904.09056","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-landscape-of-the-planted-clique-problem","title":"The Landscape of the Planted Clique Problem: Dense subgraphs and the Overlap Gap Property","date":"2019-04-15","arxiv_id":"1904.07174","repositories_listed":0,"syntology":null},{"url":null,"slug":"approximation-in-lp-with-deep-relu-neural","title":"Approximation in $L^p(μ)$ with deep ReLU neural networks","date":"2019-04-09","arxiv_id":"1904.04789","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-fictitious-play-for-stochastic","title":"Deep Fictitious Play for Stochastic Differential Games","date":"2019-03-22","arxiv_id":"1903.09376","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-two-layer-networks-with-multinomial","title":"Recovering the Lowest Layer of Deep Networks with High Threshold Activations","date":"2019-03-21","arxiv_id":"1903.09231","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-nonasymptotic-law-of-iterated-logarithm-for","title":"A nonasymptotic law of iterated logarithm for general M-estimators","date":"2019-03-15","arxiv_id":"1903.06576","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-approximation-of-frequent-k-mers-and","title":"Fast Approximation of Frequent $k$-mers and Applications to Metagenomics","date":"2019-02-26","arxiv_id":"1902.10168","repositories_listed":0,"syntology":null},{"url":null,"slug":"integrated-analysis-of-the-urban-water","title":"Integrated analysis of the urban water-electricity demand nexus in the Midwestern United States","date":"2019-02-26","arxiv_id":"1902.10697","repositories_listed":0,"syntology":null},{"url":null,"slug":"interpreting-active-learning-methods-through","title":"Analyzing Data Selection Techniques with Tools from the Theory of Information Losses","date":"2019-02-25","arxiv_id":"1902.09602","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalisation-in-fully-connected-neural","title":"Generalisation in fully-connected neural networks for time series forecasting","date":"2019-02-14","arxiv_id":"1902.05312","repositories_listed":0,"syntology":null},{"url":null,"slug":"scaling-limits-of-wide-neural-networks-with","title":"Scaling Limits of Wide Neural Networks with Weight Sharing: Gaussian Process Behavior, Gradient Independence, and Neural Tangent Kernel Derivation","date":"2019-02-13","arxiv_id":"1902.04760","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-theory-and-support-vector-machines-a","title":"Learning Theory and Support Vector Machines - a primer","date":"2019-02-12","arxiv_id":"1902.04622","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-hyperparameter-tuning-using-bayesian","title":"Fast Hyperparameter Tuning using Bayesian Optimization with Directional Derivatives","date":"2019-02-06","arxiv_id":"1902.02416","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributional-property-testing-in-a-quantum","title":"Distributional property testing in a quantum world","date":"2019-02-02","arxiv_id":"1902.00814","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-generalization-error-bounds-of-noisy","title":"On Generalization Error Bounds of Noisy Gradient Methods for Non-Convex Learning","date":"2019-02-02","arxiv_id":"1902.00621","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-schatten-von-neumann-operators","title":"Learning Schatten--von Neumann Operators","date":"2019-01-29","arxiv_id":"1901.10076","repositories_listed":0,"syntology":null},{"url":null,"slug":"anomaly-detecting-and-ranking-of-the-cloud","title":"Anomaly detecting and ranking of the cloud computing platform by multi-view learning","date":"2019-01-27","arxiv_id":"1901.09294","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-statistical-efficiency-of-optimal","title":"Optimality Implies Kernel Sum Classifiers are Statistically Efficient","date":"2019-01-25","arxiv_id":"1901.09087","repositories_listed":0,"syntology":null},{"url":null,"slug":"tighter-problem-dependent-regret-bounds-in","title":"Tighter Problem-Dependent Regret Bounds in Reinforcement Learning without Domain Knowledge using Value Function Bounds","date":"2019-01-01","arxiv_id":"1901.00210","repositories_listed":0,"syntology":null},{"url":null,"slug":"max-diversity-distributed-learning-theory-and","title":"Max-Diversity Distributed Learning: Theory and Algorithms","date":"2018-12-19","arxiv_id":"1812.07738","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-reinforcement-learning-and-the-deadly","title":"Deep Reinforcement Learning and the Deadly Triad","date":"2018-12-06","arxiv_id":"1812.02648","repositories_listed":0,"syntology":null},{"url":null,"slug":"machine-learning-of-coarse-grained-molecular","title":"Machine Learning of coarse-grained Molecular Dynamics Force Fields","date":"2018-12-04","arxiv_id":"1812.01736","repositories_listed":0,"syntology":null}],"record_sha256":"578539772317eae9cc265b5a5d19caa831f9a59eba8d4bc89fb51bb977108235","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}