{"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/lemma/papers/2","list_of":"/task/lemma","task":"LEMMA","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":7,"rows_per_page":100,"rows":[101,200],"of":628,"counts":{"archive_papers_tagged":628,"with_a_code_link":102,"where_syntology_ran_a_sample":18,"not_listed_spam_title":0,"listed":628,"listed_where_code_ran":18,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":17,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":17,"listed_every_run_a_failure_of_syntologys_instrument":1,"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/lemma","prev":"/task/lemma","next":"/task/lemma/papers/3","papers":[{"url":"/paper/morphological-inflection-generation-using","slug":"morphological-inflection-generation-using","title":"Morphological Inflection Generation Using Character Sequence to Sequence Learning","date":"2015-12-18","arxiv_id":"1512.06110","repositories_listed":1,"syntology":null},{"url":"/paper/lectures-on-jacques-herbrand-as-a-logician","slug":"lectures-on-jacques-herbrand-as-a-logician","title":"Lectures on Jacques Herbrand as a Logician","date":"2009-02-26","arxiv_id":"0902.4682","repositories_listed":1,"syntology":null},{"url":null,"slug":"alpay-algebra-v-multi-layered-semantic-games","title":"Alpay Algebra V: Multi-Layered Semantic Games and Transfinite Fixed-Point Simulation","date":"2025-07-10","arxiv_id":"2507.07868","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-regret-perspective-on-online-selective","title":"A Regret Perspective on Online Selective Generation","date":"2025-06-16","arxiv_id":"2506.14067","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-event-triggered-controllers-for","title":"Learning event-triggered controllers for linear parameter-varying systems from data","date":"2025-06-10","arxiv_id":"2506.08366","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-transceiver-design-for-ris-enhanced","title":"Robust Transceiver Design for RIS Enhanced Dual-Functional Radar-Communication with Movable Antenna","date":"2025-06-09","arxiv_id":"2506.07610","repositories_listed":0,"syntology":null},{"url":null,"slug":"gumbel-max-list-sampling-for-distribution","title":"Gumbel-max List Sampling for Distribution Coupling with Multiple Samples","date":"2025-06-05","arxiv_id":"2506.05632","repositories_listed":0,"syntology":null},{"url":null,"slug":"sample-optimal-learning-of-quantum-states","title":"Sample-optimal learning of quantum states using gentle measurements","date":"2025-05-30","arxiv_id":"2505.24587","repositories_listed":0,"syntology":null},{"url":null,"slug":"why-is-it-easier-to-predict-the-epidemic","title":"Why is it easier to predict the epidemic curve than to reconstruct the underlying contact network?","date":"2025-05-29","arxiv_id":"2506.00059","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-diffusion-models-for-symmetric","title":"Efficient Diffusion Models for Symmetric Manifolds","date":"2025-05-27","arxiv_id":"2505.21640","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-packing-lemma-for-vcn-k-dimension-and","title":"A packing lemma for VCN${}_k$-dimension and learning high-dimensional data","date":"2025-05-21","arxiv_id":"2505.15688","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-local-polyak-lojasiewicz-and-descent-lemma","title":"A Local Polyak-Lojasiewicz and Descent Lemma of Gradient Descent For Overparametrized Linear Models","date":"2025-05-16","arxiv_id":"2505.11664","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-driven-internal-model-control-for-output","title":"Data-driven Internal Model Control for Output Regulation","date":"2025-05-14","arxiv_id":"2505.09255","repositories_listed":0,"syntology":null},{"url":null,"slug":"bounding-neyman-pearson-region-with-f","title":"Bounding Neyman-Pearson Region with $f$-Divergences","date":"2025-05-13","arxiv_id":"2505.08899","repositories_listed":0,"syntology":null},{"url":null,"slug":"euclidean-distance-matrix-completion-via","title":"Euclidean Distance Matrix Completion via Asymmetric Projected Gradient Descent","date":"2025-04-28","arxiv_id":"2504.19530","repositories_listed":0,"syntology":null},{"url":null,"slug":"building-ud-cairo-for-old-english-in-the","title":"Building UD Cairo for Old English in the Classroom","date":"2025-04-25","arxiv_id":"2504.18718","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-learning-on-large-graphs-using-a","title":"Efficient Learning on Large Graphs using a Densifying Regularity Lemma","date":"2025-04-25","arxiv_id":"2504.18273","repositories_listed":0,"syntology":null},{"url":null,"slug":"secondary-safety-control-for-systems-with","title":"Secondary Safety Control for Systems with Sector Bounded Nonlinearities [Extended Version]","date":"2025-04-11","arxiv_id":"2504.08535","repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-non-steady-state-frequency-domain","title":"Leveraging Non-Steady-State Frequency-Domain Data in Willems' Fundamental Lemma","date":"2025-04-08","arxiv_id":"2504.06403","repositories_listed":0,"syntology":null},{"url":null,"slug":"lemmanaid-neuro-symbolic-lemma-conjecturing","title":"Lemmanaid: Neuro-Symbolic Lemma Conjecturing","date":"2025-04-07","arxiv_id":"2504.04942","repositories_listed":0,"syntology":null},{"url":null,"slug":"nonlinear-multiple-response-regression-and","title":"Nonlinear Multiple Response Regression and Learning of Latent Spaces","date":"2025-03-27","arxiv_id":"2503.21608","repositories_listed":0,"syntology":null},{"url":null,"slug":"local-stability-and-stabilization-of","title":"Local Stability and Stabilization of Quadratic-Bilinear Systems using Petersen's Lemma","date":"2025-03-26","arxiv_id":"2503.21040","repositories_listed":0,"syntology":null},{"url":null,"slug":"geometric-meta-learning-via-coupled-ricci","title":"Geometric Meta-Learning via Coupled Ricci Flow: Unifying Knowledge Representation and Quantum Entanglement","date":"2025-03-25","arxiv_id":"2503.19867","repositories_listed":0,"syntology":null},{"url":null,"slug":"inverter-control-with-time-varying-and","title":"Inverter Control with Time-Varying and Nonconvex State and Input Constraints","date":"2025-03-14","arxiv_id":"2503.11075","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-injective-norm-of-sums-of-random","title":"On the Injective Norm of Sums of Random Tensors and the Moments of Gaussian Chaoses","date":"2025-03-13","arxiv_id":"2503.10580","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantitative-flow-approximation-properties-of","title":"Quantitative Flow Approximation Properties of Narrow Neural ODEs","date":"2025-03-06","arxiv_id":"2503.04068","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-convergence-of-adam-type-algorithm-for","title":"On the Convergence of Adam-Type Algorithm for Bilevel Optimization under Unbounded Smoothness","date":"2025-03-05","arxiv_id":"2503.03908","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-dichotomy-between-privacy-and","title":"On the Dichotomy Between Privacy and Traceability in $\\ell_p$ Stochastic Convex Optimization","date":"2025-02-24","arxiv_id":"2502.17384","repositories_listed":0,"syntology":null},{"url":null,"slug":"compression-barriers-for-autoregressive","title":"Compression Barriers for Autoregressive Transformers","date":"2025-02-21","arxiv_id":"2502.15955","repositories_listed":0,"syntology":null},{"url":null,"slug":"do-we-need-to-verify-step-by-step-rethinking","title":"Do We Need to Verify Step by Step? Rethinking Process Supervision from a Theoretical Perspective","date":"2025-02-14","arxiv_id":"2502.10581","repositories_listed":0,"syntology":null},{"url":null,"slug":"residualised-treatment-intensity-and-the","title":"Residualised Treatment Intensity and the Estimation of Average Partial Effects","date":"2025-02-14","arxiv_id":"2502.10301","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-stochastic-fundamental-lemma-with-reduced","title":"A Stochastic Fundamental Lemma with Reduced Disturbance Data Requirements","date":"2025-02-13","arxiv_id":"2502.09131","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-enabled-predictive-control-for-flexible","title":"Data-Enabled Predictive Control for Flexible Spacecraft","date":"2025-02-13","arxiv_id":"2502.09531","repositories_listed":0,"syntology":null},{"url":null,"slug":"any-stepsize-gradient-descent-for-separable","title":"Any-stepsize Gradient Descent for Separable Data under Fenchel--Young Losses","date":"2025-02-07","arxiv_id":"2502.04889","repositories_listed":0,"syntology":null},{"url":null,"slug":"kotlarski-s-lemma-for-dyadic-models","title":"Kotlarski's lemma for dyadic models","date":"2025-02-04","arxiv_id":"2502.02734","repositories_listed":0,"syntology":null},{"url":null,"slug":"gaussian-process-based-prediction-and-control","title":"Gaussian Process-Based Prediction and Control of Hammerstein-Wiener Systems","date":"2025-01-27","arxiv_id":"2501.15849","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-intrinsic-state-variable-in-fundamental","title":"The Intrinsic State Variable in Fundamental Lemma and Its Use in Stability Design for Data-based Control","date":"2025-01-22","arxiv_id":"2501.12626","repositories_listed":0,"syntology":null},{"url":null,"slug":"no-regret-linear-bandits-under-gap-adjusted","title":"No-Regret Linear Bandits under Gap-Adjusted Misspecification","date":"2025-01-09","arxiv_id":"2501.05361","repositories_listed":0,"syntology":null},{"url":null,"slug":"glilem-leveraging-gliner-for-contextualized","title":"GliLem: Leveraging GliNER for Contextualized Lemmatization in Estonian","date":"2024-12-29","arxiv_id":"2412.20597","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-generalized-schrodinger-bridges-from","title":"Deep Generalized Schrödinger Bridges: From Image Generation to Solving Mean-Field Games","date":"2024-12-28","arxiv_id":"2412.20279","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-good-is-gpt-at-writing-political-speeches","title":"How good is GPT at writing political speeches for the White House?","date":"2024-12-19","arxiv_id":"2412.14617","repositories_listed":0,"syntology":null},{"url":null,"slug":"disturbance-adaptive-data-driven-predictive","title":"Disturbance-Adaptive Data-Driven Predictive Control: Trading Comfort Violations for Savings in Building Climate Control","date":"2024-12-12","arxiv_id":"2412.09238","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-k-inductive-control-barrier","title":"Learning k-Inductive Control Barrier Certificates for Unknown Nonlinear Dynamics Beyond Polynomials","date":"2024-12-10","arxiv_id":"2412.07232","repositories_listed":0,"syntology":null},{"url":null,"slug":"score-change-of-variables","title":"Score Change of Variables","date":"2024-12-10","arxiv_id":"2412.07904","repositories_listed":0,"syntology":null},{"url":null,"slug":"generating-rectifiable-measures-through","title":"Generating Rectifiable Measures through Neural Networks","date":"2024-12-06","arxiv_id":"2412.05109","repositories_listed":0,"syntology":null},{"url":null,"slug":"certified-learning-of-incremental-iss","title":"Certified Learning of Incremental ISS Controllers for Unknown Nonlinear Polynomial Dynamics","date":"2024-12-05","arxiv_id":"2412.03901","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-lean-dataset-for-international-math","title":"A Lean Dataset for International Math Olympiad: Small Steps towards Writing Math Proofs for Hard Problems","date":"2024-11-28","arxiv_id":"2411.18872","repositories_listed":0,"syntology":null},{"url":null,"slug":"chatgpt-as-speechwriter-for-the-french","title":"ChatGPT as speechwriter for the French presidents","date":"2024-11-27","arxiv_id":"2411.18382","repositories_listed":0,"syntology":null},{"url":null,"slug":"gpt-as-ghostwriter-at-the-white-house","title":"GPT as ghostwriter at the White House","date":"2024-11-27","arxiv_id":"2411.18365","repositories_listed":0,"syntology":null},{"url":null,"slug":"linear-convergence-of-proximal-descent","title":"Linear convergence of proximal descent schemes on the Wasserstein space","date":"2024-11-22","arxiv_id":"2411.15067","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparsifying-suprema-of-gaussian-processes","title":"Sparsifying Suprema of Gaussian Processes","date":"2024-11-22","arxiv_id":"2411.14664","repositories_listed":0,"syntology":null},{"url":null,"slug":"nonlinear-bayesian-filtering-with-natural","title":"Nonlinear Bayesian Filtering with Natural Gradient Gaussian Approximation","date":"2024-10-21","arxiv_id":"2410.15832","repositories_listed":0,"syntology":null},{"url":null,"slug":"exact-byte-level-probabilities-from-tokenized","title":"Exact Byte-Level Probabilities from Tokenized Language Models for FIM-Tasks and Model Ensembles","date":"2024-10-11","arxiv_id":"2410.09303","repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-sample-complexity-for-global","title":"Improved Sample Complexity for Global Convergence of Actor-Critic Algorithms","date":"2024-10-11","arxiv_id":"2410.08868","repositories_listed":0,"syntology":null},{"url":null,"slug":"assouad-fano-and-le-cam-with-interaction-a","title":"Assouad, Fano, and Le Cam with Interaction: A Unifying Lower Bound Framework and Characterization for Bandit Learnability","date":"2024-10-07","arxiv_id":"2410.05117","repositories_listed":0,"syntology":null},{"url":null,"slug":"convergent-privacy-loss-of-noisy-sgd-without","title":"Convergent Privacy Loss of Noisy-SGD without Convexity and Smoothness","date":"2024-10-01","arxiv_id":"2410.01068","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-implicit-relation-between-low-rank","title":"On the Implicit Relation Between Low-Rank Adaptation and Differential Privacy","date":"2024-09-26","arxiv_id":"2409.17538","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-complexity-of-neural-computation-in","title":"On the Complexity of Neural Computation in Superposition","date":"2024-09-05","arxiv_id":"2409.15318","repositories_listed":0,"syntology":null},{"url":null,"slug":"characterizing-nonlinear-systems-with-mixed","title":"Characterizing nonlinear systems with mixed input-output properties through dissipation inequalities","date":"2024-08-30","arxiv_id":"2409.00282","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-enabled-predictive-repetitive-control-1","title":"Data-enabled Predictive Repetitive Control","date":"2024-08-27","arxiv_id":"2408.15210","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-backtracking-for-faster-optimization","title":"Adaptive Backtracking Line Search","date":"2024-08-23","arxiv_id":"2408.13150","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-approximability-of-stationary","title":"On the Approximability of Stationary Processes using the ARMA Model","date":"2024-08-20","arxiv_id":"2408.10610","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-reinforcement-learning-in-1","title":"Efficient Reinforcement Learning in Probabilistic Reward Machines","date":"2024-08-19","arxiv_id":"2408.10381","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-event-triggered-control-with-sampled","title":"Adaptive Event-triggered Control with Sampled Transmitted Output and Controller Dynamics","date":"2024-07-16","arxiv_id":"2407.11397","repositories_listed":0,"syntology":null},{"url":null,"slug":"fedsllm-federated-split-learning-for-large","title":"FedsLLM: Federated Split Learning for Large Language Models over Communication Networks","date":"2024-07-12","arxiv_id":"2407.09250","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-backstepping-and-non-singular","title":"Adaptive Backstepping and Non-singular Sliding Mode Control for Quadrotor UAVs with Unknown Time-varying Uncertainties","date":"2024-07-09","arxiv_id":"2407.07175","repositories_listed":0,"syntology":null},{"url":null,"slug":"augmented-bayesian-policy-search","title":"Augmented Bayesian Policy Search","date":"2024-07-05","arxiv_id":"2407.04864","repositories_listed":0,"syntology":null},{"url":null,"slug":"graphon-particle-systems-part-ii-dynamics-of","title":"Graphon Particle Systems, Part II: Dynamics of Distributed Stochastic Continuum Optimization","date":"2024-07-03","arxiv_id":"2407.02765","repositories_listed":0,"syntology":null},{"url":null,"slug":"superconstant-inapproximability-of-decision","title":"Superconstant Inapproximability of Decision Tree Learning","date":"2024-07-01","arxiv_id":"2407.01402","repositories_listed":0,"syntology":null},{"url":"/paper/to-word-senses-and-beyond-inducing-concepts","slug":"to-word-senses-and-beyond-inducing-concepts","title":"To Word Senses and Beyond: Inducing Concepts with Contextualized Language Models","date":"2024-06-28","arxiv_id":"2406.20054","repositories_listed":0,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/to-word-senses-and-beyond-inducing-concepts#ran","syntology_url":"https://syntology.ai/paper/2406.20054","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.20054"}},"official":null}},{"url":null,"slug":"an-optimal-tightness-bound-for-the-simulation","title":"An Optimal Tightness Bound for the Simulation Lemma","date":"2024-06-24","arxiv_id":"2406.16249","repositories_listed":0,"syntology":null},{"url":null,"slug":"background-results-for-robust-minmax-control","title":"Background results for robust minmax control of linear dynamical systems","date":"2024-06-21","arxiv_id":"2406.15682","repositories_listed":0,"syntology":null},{"url":null,"slug":"discrete-time-conewise-linear-systems-with","title":"Discrete-Time Conewise Linear Systems with Finitely Many Switches","date":"2024-06-18","arxiv_id":"2406.12530","repositories_listed":0,"syntology":null},{"url":null,"slug":"frequency-domain-data-driven-predictive","title":"Frequency-Domain Data-Driven Predictive Control","date":"2024-06-18","arxiv_id":"2406.12498","repositories_listed":0,"syntology":null},{"url":null,"slug":"e-cop-episodic-constrained-optimization-of","title":"e-COP : Episodic Constrained Optimization of Policies","date":"2024-06-13","arxiv_id":"2406.09563","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-generalized-version-of-chung-s-lemma-and","title":"A Generalized Version of Chung's Lemma and its Applications","date":"2024-06-09","arxiv_id":"2406.05637","repositories_listed":0,"syntology":null},{"url":null,"slug":"lemma-rca-a-large-multi-modal-multi-domain","title":"LEMMA-RCA: A Large Multi-modal Multi-domain Dataset for Root Cause Analysis","date":"2024-06-08","arxiv_id":"2406.05375","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-overview-of-systems-theoretic-guarantees","title":"An overview of systems-theoretic guarantees in data-driven model predictive control","date":"2024-06-06","arxiv_id":"2406.04130","repositories_listed":0,"syntology":null},{"url":null,"slug":"variational-inference-mixture-of-gaussians","title":"Theoretical Guarantees for Variational Inference with Fixed-Variance Mixture of Gaussians","date":"2024-06-06","arxiv_id":"2406.04012","repositories_listed":0,"syntology":null},{"url":null,"slug":"rl-in-latent-mdps-is-tractable-online","title":"RL in Latent MDPs is Tractable: Online Guarantees via Off-Policy Evaluation","date":"2024-06-03","arxiv_id":"2406.01389","repositories_listed":0,"syntology":null},{"url":null,"slug":"training-efficient-density-quantum-machine","title":"Training-efficient density quantum machine learning","date":"2024-05-30","arxiv_id":"2405.20237","repositories_listed":0,"syntology":null},{"url":null,"slug":"laurel-generating-dafny-assertions-using","title":"Laurel: Unblocking Automated Verification with Large Language Models","date":"2024-05-27","arxiv_id":"2405.16792","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-input-output-continuous-time-version-of","title":"An input-output continuous-time version of Willems' lemma","date":"2024-05-24","arxiv_id":"2405.15482","repositories_listed":0,"syntology":null},{"url":null,"slug":"constructive-universal-approximation-theorems","title":"Deep Ridgelet Transform and Unified Universality Theorem for Deep and Shallow Joint-Group-Equivariant Machines","date":"2024-05-22","arxiv_id":"2405.13682","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-certified-proof-checker-for-deep-neural","title":"A Certified Proof Checker for Deep Neural Network Verification in Imandra","date":"2024-05-17","arxiv_id":"2405.10611","repositories_listed":0,"syntology":null},{"url":null,"slug":"restless-linear-bandits","title":"Restless Linear Bandits","date":"2024-05-17","arxiv_id":"2405.10817","repositories_listed":0,"syntology":null},{"url":null,"slug":"lower-bounds-for-private-estimation-of","title":"Lower Bounds for Private Estimation of Gaussian Covariance Matrices under All Reasonable Parameter Regimes","date":"2024-04-26","arxiv_id":"2404.17714","repositories_listed":0,"syntology":null},{"url":null,"slug":"node-similarities-under-random-projections","title":"Node Similarities under Random Projections: Limits and Pathological Cases","date":"2024-04-15","arxiv_id":"2404.10148","repositories_listed":0,"syntology":null},{"url":null,"slug":"farkas-lemma-and-complete-indifference","title":"Farkas' Lemma and Complete Indifference","date":"2024-04-03","arxiv_id":"2404.02620","repositories_listed":0,"syntology":null},{"url":null,"slug":"convergence-guarantees-for-rmsprop-and-adam-1","title":"Convergence Guarantees for RMSProp and Adam in Generalized-smooth Non-convex Optimization with Affine Noise Variance","date":"2024-04-01","arxiv_id":"2404.01436","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-lscd-benchmark-a-testbed-for-diachronic","title":"The LSCD Benchmark: a Testbed for Diachronic Word Meaning Tasks","date":"2024-03-29","arxiv_id":"2404.00176","repositories_listed":0,"syntology":null},{"url":null,"slug":"sample-complexity-of-quantum-hypothesis","title":"An invitation to the sample complexity of quantum hypothesis testing","date":"2024-03-26","arxiv_id":"2403.17868","repositories_listed":0,"syntology":null},{"url":null,"slug":"decoupling-parameter-variation-from-noise","title":"Decoupling parameter variation from noise: Biquadratic Lyapunov forms in data-driven LPV control","date":"2024-03-25","arxiv_id":"2403.16565","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-raw-data-to-safety-reducing-conservatism","title":"From Raw Data to Safety: Reducing Conservatism by Set Expansion","date":"2024-03-23","arxiv_id":"2403.15883","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-data-driven-prediction-and-predictive","title":"Optimal Data-Driven Prediction and Predictive Control using Signal Matrix Models","date":"2024-03-22","arxiv_id":"2403.15329","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-formal-theorem-proving-a","title":"Enhancing Formal Theorem Proving: A Comprehensive Dataset for Training AI Models on Coq Code","date":"2024-03-19","arxiv_id":"2403.12627","repositories_listed":0,"syntology":null},{"url":null,"slug":"horizon-free-regret-for-linear-markov","title":"Horizon-Free Regret for Linear Markov Decision Processes","date":"2024-03-15","arxiv_id":"2403.10738","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploring-the-links-between-the-fundamental","title":"Exploring the Links between the Fundamental Lemma and Kernel Regression","date":"2024-03-08","arxiv_id":"2403.05368","repositories_listed":0,"syntology":null},{"url":null,"slug":"level-set-teleportation-an-optimization","title":"Level Set Teleportation: An Optimization Perspective","date":"2024-03-05","arxiv_id":"2403.03362","repositories_listed":0,"syntology":null},{"url":null,"slug":"mirror-descent-algorithms-with-nearly","title":"Mirror Descent Algorithms with Nearly Dimension-Independent Rates for Differentially-Private Stochastic Saddle-Point Problems","date":"2024-03-05","arxiv_id":"2403.02912","repositories_listed":0,"syntology":null}],"record_sha256":"3df797a24cb1137eaf173d698ba8dc59eb27e69469fc8e1b1993c66acabaa2b6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}