{"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/8","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":8,"pages_in_order":9,"rows_per_page":100,"rows":[701,800],"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/7","next":"/task/learning-theory/papers/9","papers":[{"url":null,"slug":"an-algorithmic-perspective-on-imitation","title":"An Algorithmic Perspective on Imitation Learning","date":"2018-11-16","arxiv_id":"1811.06711","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-and-generalization-in","title":"Learning and Generalization in Overparameterized Neural Networks, Going Beyond Two Layers","date":"2018-11-12","arxiv_id":"1811.04918","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-optimal-transport-view-on-generalization","title":"An Optimal Transport View on Generalization","date":"2018-11-08","arxiv_id":"1811.03270","repositories_listed":0,"syntology":null},{"url":null,"slug":"piecewise-strong-convexity-of-neural-networks","title":"Piecewise Strong Convexity of Neural Networks","date":"2018-10-30","arxiv_id":"1810.12805","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-generalization-of-sequence-encoder","title":"Improving Generalization of Sequence Encoder-Decoder Networks for Inverse Imaging of Cardiac Transmembrane Potential","date":"2018-10-12","arxiv_id":"1810.05713","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-properties-of-hyper-rkhs-and","title":"Generalization Properties of hyper-RKHS and its Applications","date":"2018-09-26","arxiv_id":"1809.09910","repositories_listed":0,"syntology":null},{"url":null,"slug":"when-is-there-a-representer-theorem-reflexive","title":"When is there a Representer Theorem? Reflexive Banach spaces","date":"2018-09-26","arxiv_id":"1809.10284","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-learning-theory-approach-to-a","title":"Unsupervised parameter selection for denoising with the elastic net","date":"2018-09-23","arxiv_id":"1809.08696","repositories_listed":0,"syntology":null},{"url":null,"slug":"exponential-inequalities-for-nonstationary","title":"Exponential inequalities for nonstationary Markov Chains","date":"2018-08-27","arxiv_id":"1808.08811","repositories_listed":0,"syntology":null},{"url":null,"slug":"spectral-pruning-compressing-deep-neural","title":"Spectral Pruning: Compressing Deep Neural Networks via Spectral Analysis and its Generalization Error","date":"2018-08-26","arxiv_id":"1808.08558","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-mismatch-principle-statistical-learning","title":"The Mismatch Principle: The Generalized Lasso Under Large Model Uncertainties","date":"2018-08-20","arxiv_id":"1808.06329","repositories_listed":0,"syntology":null},{"url":null,"slug":"importance-of-the-mathematical-foundations-of","title":"Importance of the Mathematical Foundations of Machine Learning Methods for Scientific and Engineering Applications","date":"2018-08-07","arxiv_id":"1808.02213","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-temporal-difference-reinforcement-learning","title":"A Temporal Difference Reinforcement Learning Theory of Emotion: unifying emotion, cognition and adaptive behavior","date":"2018-07-24","arxiv_id":"1807.08941","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-theory-and-algorithms-for-revenue-1","title":"Learning Theory and Algorithms for Revenue Management in Sponsored Search","date":"2018-07-05","arxiv_id":"1807.01827","repositories_listed":0,"syntology":null},{"url":null,"slug":"information-theoretic-guarantees-for","title":"Information Theoretic Guarantees for Empirical Risk Minimization with Applications to Model Selection and Large-Scale Optimization","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-learning-theory-in-linear-systems-under","title":"A Learning Theory in Linear Systems under Compositional Models","date":"2018-06-29","arxiv_id":"1807.00084","repositories_listed":0,"syntology":null},{"url":null,"slug":"localized-structured-prediction","title":"Localized Structured Prediction","date":"2018-06-06","arxiv_id":"1806.02402","repositories_listed":0,"syntology":null},{"url":null,"slug":"interpreting-deep-learning-the-machine","title":"Interpreting Deep Learning: The Machine Learning Rorschach Test?","date":"2018-06-01","arxiv_id":"1806.00148","repositories_listed":0,"syntology":null},{"url":null,"slug":"universality-of-deep-convolutional-neural","title":"Universality of Deep Convolutional Neural Networks","date":"2018-05-28","arxiv_id":"1805.10769","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-learning-generalizes-because-the","title":"Deep learning generalizes because the parameter-function map is biased towards simple functions","date":"2018-05-22","arxiv_id":"1805.08522","repositories_listed":0,"syntology":null},{"url":null,"slug":"computing-the-shattering-coefficient-of","title":"Computing the Shattering Coefficient of Supervised Learning Algorithms","date":"2018-05-07","arxiv_id":"1805.02627","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-based-compressive-mri","title":"Learning-Based Compressive MRI","date":"2018-05-03","arxiv_id":"1805.01266","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-adaptive-clipping-approach-for-proximal","title":"An Adaptive Clipping Approach for Proximal Policy Optimization","date":"2018-04-17","arxiv_id":"1804.06461","repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-the-low-degree-algorithm-mixtures-of","title":"Beyond the Low-Degree Algorithm: Mixtures of Subcubes and Their Applications","date":"2018-03-17","arxiv_id":"1803.06521","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-and-expressivity-for-deep-nets","title":"Generalization and Expressivity for Deep Nets","date":"2018-03-10","arxiv_id":"1803.03772","repositories_listed":0,"syntology":null},{"url":null,"slug":"dimension-free-information-concentration-via","title":"Dimension-free Information Concentration via Exp-Concavity","date":"2018-02-26","arxiv_id":"1802.09301","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-wisdom-of-networks-a-general-adaptation","title":"The wisdom of networks: A general adaptation and learning mechanism of complex systems: The network core triggers fast responses to known stimuli; innovations require the slow network periphery and are encoded by core-remodeling","date":"2018-02-23","arxiv_id":"1511.01238","repositories_listed":0,"syntology":null},{"url":null,"slug":"curriculum-learning-by-transfer-learning","title":"Curriculum Learning by Transfer Learning: Theory and Experiments with Deep Networks","date":"2018-02-11","arxiv_id":"1802.03796","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-error-bounds-for-noisy","title":"Generalization Error Bounds for Noisy, Iterative Algorithms","date":"2018-01-12","arxiv_id":"1801.04295","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-label-learning-for-large-text-corpora","title":"Multi-label Learning for Large Text Corpora using Latent Variable Model with Provable Gurantees","date":"2018-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"statistical-learning-theory-and-linguistic","title":"Statistical Learning Theory and Linguistic Typology: a Learnability Perspective on OT's Strict Domination","date":"2018-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"convergence-of-gradient-em-on-multi-component","title":"Convergence of Gradient EM on Multi-component Mixture of Gaussians","date":"2017-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"experimental-learning-of-quantum-states","title":"Experimental learning of quantum states","date":"2017-11-30","arxiv_id":"1712.00127","repositories_listed":0,"syntology":null},{"url":null,"slug":"providing-theoretical-learning-guarantees-to","title":"Providing theoretical learning guarantees to Deep Learning Networks","date":"2017-11-28","arxiv_id":"1711.10292","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-communication-complexity-of-classification","title":"On Communication Complexity of Classification Problems","date":"2017-11-16","arxiv_id":"1711.05893","repositories_listed":0,"syntology":null},{"url":null,"slug":"fado-a-deterministic-detectionlearning","title":"FADO: A Deterministic Detection/Learning Algorithm","date":"2017-11-07","arxiv_id":"1711.02361","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparsity-variance-and-curvature-in-multi","title":"Sparsity, variance and curvature in multi-armed bandits","date":"2017-11-03","arxiv_id":"1711.01037","repositories_listed":0,"syntology":null},{"url":null,"slug":"algorithmic-learning-of-probability","title":"Algorithmic learning of probability distributions from random data in the limit","date":"2017-10-31","arxiv_id":"1710.11303","repositories_listed":0,"syntology":null},{"url":null,"slug":"regularization-approaches-for-support-vector","title":"Regularization approaches for support vector machines with applications to biomedical data","date":"2017-10-29","arxiv_id":"1710.10600","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-approach-to-one-bit-compressed-sensing","title":"An Approach to One-Bit Compressed Sensing Based on Probably Approximately Correct Learning Theory","date":"2017-10-22","arxiv_id":"1710.07973","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-tight-excess-risk-bound-via-a-unified-pac","title":"A Tight Excess Risk Bound via a Unified PAC-Bayesian-Rademacher-Shtarkov-MDL Complexity","date":"2017-10-21","arxiv_id":"1710.07732","repositories_listed":0,"syntology":null},{"url":null,"slug":"function-norms-and-regularization-in-deep","title":"Function Norms and Regularization in Deep Networks","date":"2017-10-18","arxiv_id":"1710.06703","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-neural-networks-with-two-nonlinear","title":"Learning Neural Networks with Two Nonlinear Layers in Polynomial Time","date":"2017-09-18","arxiv_id":"1709.06010","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-denoising-loss-bound-for-neural-network","title":"A Denoising Loss Bound for Neural Network based Universal Discrete Denoisers","date":"2017-09-12","arxiv_id":"1709.03657","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-theory-of-distributed-regression","title":"Learning Theory of Distributed Regression with Bias Corrected Regularization Kernel Network","date":"2017-08-07","arxiv_id":"1708.01960","repositories_listed":0,"syntology":null},{"url":null,"slug":"consistency-analysis-for-binary","title":"Consistency Analysis for Binary Classification Revisited","date":"2017-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"the-topology-of-statistical-verifiability","title":"The Topology of Statistical Verifiability","date":"2017-07-27","arxiv_id":"1707.09378","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-bounds-of-sgld-for-non-convex","title":"Generalization Bounds of SGLD for Non-convex Learning: Two Theoretical Viewpoints","date":"2017-07-19","arxiv_id":"1707.05947","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-choice-new-machine-learning-problem","title":"Optimal choice: new machine learning problem and its solution","date":"2017-06-26","arxiv_id":"1706.08439","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-whenever-learning-is-possible","title":"Learning Whenever Learning is Possible: Universal Learning under General Stochastic Processes","date":"2017-06-05","arxiv_id":"1706.01418","repositories_listed":0,"syntology":null},{"url":null,"slug":"nonconvex-penalties-with-analytical-solutions","title":"Nonconvex penalties with analytical solutions for one-bit compressive sensing","date":"2017-06-04","arxiv_id":"1706.01014","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-with-average-top-k-loss","title":"Learning with Average Top-k Loss","date":"2017-05-24","arxiv_id":"1705.08826","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-free-energy-principle-for-action-and","title":"The free energy principle for action and perception: A mathematical review","date":"2017-05-24","arxiv_id":"1705.09156","repositories_listed":0,"syntology":null},{"url":null,"slug":"convergence-analysis-of-gradient-em-for-multi","title":"Convergence Analysis of Gradient EM for Multi-component Gaussian Mixture","date":"2017-05-23","arxiv_id":"1705.08530","repositories_listed":0,"syntology":null},{"url":null,"slug":"stabiliser-states-are-efficiently-pac","title":"Stabiliser states are efficiently PAC-learnable","date":"2017-04-30","arxiv_id":"1705.00345","repositories_listed":0,"syntology":null},{"url":null,"slug":"inference-in-sparse-graphs-with-pairwise","title":"Inference in Sparse Graphs with Pairwise Measurements and Side Information","date":"2017-03-08","arxiv_id":"1703.02728","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-opacity-in-stratal-maximum-entropy","title":"Learning opacity in Stratal Maximum Entropy Grammar","date":"2017-03-07","arxiv_id":"1703.02517","repositories_listed":0,"syntology":null},{"url":null,"slug":"simple-to-complex-cross-modal-learning-to","title":"Simple to Complex Cross-modal Learning to Rank","date":"2017-02-04","arxiv_id":"1702.01229","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-of-quantum-learning-theory","title":"A Survey of Quantum Learning Theory","date":"2017-01-24","arxiv_id":"1701.06806","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-reject-and-refine-options-in-multicategory","title":"On Reject and Refine Options in Multicategory Classification","date":"2017-01-09","arxiv_id":"1701.02265","repositories_listed":0,"syntology":null},{"url":null,"slug":"resolving-the-paradox-of-evolvability-with","title":"Resolving the paradox of evolvability with learning theory: How evolution learns to improve evolvability on rugged fitness landscapes","date":"2016-12-18","arxiv_id":"1612.05955","repositories_listed":0,"syntology":null},{"url":null,"slug":"without-replacement-sampling-for-stochastic-1","title":"Without-Replacement Sampling for Stochastic Gradient Methods","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"error-analysis-of-regularized-least-square","title":"Error analysis of regularized least-square regression with Fredholm kernel","date":"2016-11-21","arxiv_id":"1611.06670","repositories_listed":0,"syntology":null},{"url":null,"slug":"using-empirical-covariance-matrix-in","title":"Using Empirical Covariance Matrix in Enhancing Prediction Accuracy of Linear Models with Missing Information","date":"2016-11-21","arxiv_id":"1611.07093","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-theoretic-foundations-of-algorithm","title":"Learning-Theoretic Foundations of Algorithm Configuration for Combinatorial Partitioning Problems","date":"2016-11-14","arxiv_id":"1611.04535","repositories_listed":0,"syntology":null},{"url":null,"slug":"statistical-learning-theory-approach-for-data","title":"Statistical Learning Theory Approach for Data Classification with l-diversity","date":"2016-10-18","arxiv_id":"1610.05815","repositories_listed":0,"syntology":null},{"url":null,"slug":"phase-retrieval-meets-statistical-learning","title":"Phase Retrieval Meets Statistical Learning Theory: A Flexible Convex Relaxation","date":"2016-10-13","arxiv_id":"1610.04210","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-statistical-learning-via-the-lens-of","title":"On statistical learning via the lens of compression","date":"2016-10-12","arxiv_id":"1610.03592","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-efficient-high-probability-algorithm-for","title":"An efficient high-probability algorithm for Linear Bandits","date":"2016-10-06","arxiv_id":"1610.02072","repositories_listed":0,"syntology":null},{"url":null,"slug":"new-steps-on-the-exact-learning-of-cnf","title":"New Steps on the Exact Learning of CNF","date":"2016-09-10","arxiv_id":"1609.03054","repositories_listed":0,"syntology":null},{"url":null,"slug":"machine-learning-with-guarantees-using","title":"Machine Learning with Guarantees using Descriptive Complexity and SMT Solvers","date":"2016-09-09","arxiv_id":"1609.02664","repositories_listed":0,"syntology":null},{"url":null,"slug":"testing-k-monotonicity","title":"Testing $k$-Monotonicity","date":"2016-09-01","arxiv_id":"1609.00265","repositories_listed":0,"syntology":null},{"url":null,"slug":"uniform-generalization-concentration-and","title":"Uniform Generalization, Concentration, and Adaptive Learning","date":"2016-08-22","arxiv_id":"1608.06072","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-general-characterization-of-the-statistical","title":"A General Characterization of the Statistical Query Complexity","date":"2016-08-07","arxiv_id":"1608.02198","repositories_listed":0,"syntology":null},{"url":null,"slug":"distribution-dependent-concentration","title":"Distribution-dependent concentration inequalities for tighter generalization bounds","date":"2016-07-19","arxiv_id":"1607.05506","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-quantum-sample-complexity-of-learning","title":"Optimal Quantum Sample Complexity of Learning Algorithms","date":"2016-07-04","arxiv_id":"1607.00932","repositories_listed":0,"syntology":null},{"url":null,"slug":"sample-complexity-of-automated-mechanism","title":"Sample Complexity of Automated Mechanism Design","date":"2016-06-13","arxiv_id":"1606.04145","repositories_listed":0,"syntology":null},{"url":null,"slug":"inductive-supervised-quantum-learning","title":"Inductive supervised quantum learning","date":"2016-05-24","arxiv_id":"1605.07541","repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-over-priors-for-boosting-control","title":"Leveraging Over Priors for Boosting Control of Prosthetic Hands","date":"2016-05-24","arxiv_id":"1605.07498","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-sampling-strategy-for-evaluation-of","title":"On the Sampling Strategy for Evaluation of Spectral-spatial Methods in Hyperspectral Image Classification","date":"2016-05-19","arxiv_id":"1605.05829","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-theory-estimates-with-observations","title":"Learning theory estimates with observations from general stationary stochastic processes","date":"2016-05-10","arxiv_id":"1605.02887","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-possibilistic-logic-theories-from","title":"Learning Possibilistic Logic Theories from Default Rules","date":"2016-04-18","arxiv_id":"1604.05273","repositories_listed":0,"syntology":null},{"url":null,"slug":"1-bit-matrix-completion-pac-bayesian-analysis","title":"1-bit Matrix Completion: PAC-Bayesian Analysis of a Variational Approximation","date":"2016-04-14","arxiv_id":"1604.04191","repositories_listed":0,"syntology":null},{"url":null,"slug":"collaborative-prediction-with-expert-advice","title":"Collaborative prediction with expert advice","date":"2016-03-20","arxiv_id":"1603.06265","repositories_listed":0,"syntology":null},{"url":null,"slug":"without-replacement-sampling-for-stochastic","title":"Without-Replacement Sampling for Stochastic Gradient Methods: Convergence Results and Application to Distributed Optimization","date":"2016-03-02","arxiv_id":"1603.00570","repositories_listed":0,"syntology":null},{"url":null,"slug":"parametric-prediction-from-parametric-agents","title":"Parametric Prediction from Parametric Agents","date":"2016-02-24","arxiv_id":"1602.07435","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-model-of-selective-advantage-for-the","title":"A Model of Selective Advantage for the Efficient Inference of Cancer Clonal Evolution","date":"2016-02-15","arxiv_id":"1602.07614","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-sufficient-statistics-construction-of","title":"A Sufficient Statistics Construction of Bayesian Nonparametric Exponential Family Conjugate Models","date":"2016-01-10","arxiv_id":"1601.02257","repositories_listed":0,"syntology":null},{"url":null,"slug":"revisiting-differentially-private-regression","title":"Revisiting Differentially Private Regression: Lessons From Learning Theory and their Consequences","date":"2015-12-20","arxiv_id":"1512.06388","repositories_listed":0,"syntology":null},{"url":null,"slug":"algorithmic-stability-and-uniform","title":"Algorithmic Stability and Uniform Generalization","date":"2015-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-theory-and-algorithms-for","title":"Learning Theory and Algorithms for Forecasting Non-stationary Time Series","date":"2015-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-pseudo-dimension-of-nearly-optimal","title":"On the Pseudo-Dimension of Nearly Optimal Auctions","date":"2015-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-pac-approach-to-application-specific","title":"A PAC Approach to Application-Specific Algorithm Selection","date":"2015-11-23","arxiv_id":"1511.07147","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-fourier-transform-of-poisson-multinomial","title":"The Fourier Transform of Poisson Multinomial Distributions and its Algorithmic Applications","date":"2015-11-11","arxiv_id":"1511.03592","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-collaborative-filtering-from-implicit","title":"Fast Collaborative Filtering from Implicit Feedback with Provable Guarantees","date":"2015-11-03","arxiv_id":"1511.00792","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-robustness-of-regularized-pairwise","title":"On the Robustness of Regularized Pairwise Learning Methods Based on Kernels","date":"2015-10-12","arxiv_id":"1510.03267","repositories_listed":0,"syntology":null},{"url":null,"slug":"algorithmic-statistics-prediction-and-machine","title":"Algorithmic statistics, prediction and machine learning","date":"2015-09-17","arxiv_id":"1509.05473","repositories_listed":0,"syntology":null},{"url":null,"slug":"another-look-at-dwd-thrifty-algorithm-and","title":"Another Look at DWD: Thrifty Algorithm and Bayes Risk Consistency in RKHS","date":"2015-08-24","arxiv_id":"1508.05913","repositories_listed":0,"syntology":null},{"url":null,"slug":"2-notes-on-classes-with-vapnik-chervonenkis","title":"2 Notes on Classes with Vapnik-Chervonenkis Dimension 1","date":"2015-07-19","arxiv_id":"1507.05307","repositories_listed":0,"syntology":null},{"url":null,"slug":"kernel-methods-for-linear-discrete-time","title":"Kernel Methods for Linear Discrete-Time Equations","date":"2015-07-11","arxiv_id":"1507.03111","repositories_listed":0,"syntology":null}],"record_sha256":"0d299fc0b6f0554d5df08b203f6713d492886bb9d65fc1f5a31f5482632d8f56","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}