{"url":"/task/lemma","name":"LEMMA","slug":"lemma","description_markdown":null,"categories":[],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":628,"papers_with_code":102,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":1,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[{"url":"/dataset/universal-dependencies","name":"Universal Dependencies","full_name":"","num_papers_in_archive":520}],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":30,"of":102,"tagged_in_all":628,"items":[{"url":"/paper/trust-region-policy-optimisation-in-multi","title":"Trust Region Policy Optimisation in Multi-Agent Reinforcement Learning","date":"2021-09-23","arxiv_id":"2109.11251","repositories_listed":11,"syntology":{"n":5,"n_ran":2,"n_unverified":3,"n_pointer_only":0}},{"url":"/paper/hyperagent-a-simple-scalable-efficient-and","title":"Q-Star Meets Scalable Posterior Sampling: Bridging Theory and Practice via HyperAgent","date":"2024-02-05","arxiv_id":"2402.10228","repositories_listed":3,"syntology":{"n":7,"n_ran":3,"n_unverified":4,"n_pointer_only":0}},{"url":"/paper/deep-generation-of-coq-lemma-names-using","title":"Deep Generation of Coq Lemma Names Using Elaborated Terms","date":"2020-04-16","arxiv_id":"2004.07761","repositories_listed":3,"syntology":null},{"url":"/paper/unimorph-20-universal-morphology","title":"UniMorph 2.0: Universal Morphology","date":"2018-10-25","arxiv_id":"1810.11101","repositories_listed":3,"syntology":null},{"url":"/paper/jl-lemma-derived-optimal-projections-for","title":"Optimal Projections for Discriminative Dictionary Learning using the JL-lemma","date":"2023-08-27","arxiv_id":"2308.13991","repositories_listed":2,"syntology":null},{"url":"/paper/adaptive-data-driven-predictive-control-as-a","title":"Adaptive Data-Driven Prediction in a Building Control Hierarchy: A Case Study of Demand Response in Switzerland","date":"2023-07-17","arxiv_id":"2307.08866","repositories_listed":2,"syntology":null},{"url":"/paper/post-selection-inference-with-hsic-lasso","title":"Post-selection inference with HSIC-Lasso","date":"2020-10-29","arxiv_id":"2010.15659","repositories_listed":2,"syntology":null},{"url":"/paper/on-the-distance-between-two-neural-networks","title":"On the distance between two neural networks and the stability of learning","date":"2020-02-09","arxiv_id":"2002.03432","repositories_listed":2,"syntology":null},{"url":"/paper/adversarial-target-invariant-representation","title":"Generalizing to unseen domains via distribution matching","date":"2019-11-03","arxiv_id":"1911.00804","repositories_listed":2,"syntology":{"n":1,"n_ran":0,"n_unverified":1,"n_pointer_only":0}},{"url":"/paper/deterministic-tensor-completion-with","title":"Deterministic tensor completion with hypergraph expanders","date":"2019-10-23","arxiv_id":"1910.10692","repositories_listed":2,"syntology":null},{"url":"/paper/improving-lemmatization-of-non-standard","title":"Improving Lemmatization of Non-Standard Languages with Joint Learning","date":"2019-03-16","arxiv_id":"1903.06939","repositories_listed":2,"syntology":null},{"url":"/paper/morphnet-a-sequence-to-sequence-model-that","title":"Morphological analysis using a sequence decoder","date":"2018-05-21","arxiv_id":"1805.07946","repositories_listed":2,"syntology":null},{"url":"/paper/identifying-the-smallest-adversarial-load","title":"Identifying the Smallest Adversarial Load Perturbations that Render DC-OPF Infeasible","date":"2025-07-10","arxiv_id":"2507.07850","repositories_listed":1,"syntology":null},{"url":"/paper/distributed-lyapunov-functions-for-nonlinear","title":"Distributed Lyapunov Functions for Nonlinear Networks","date":"2025-06-25","arxiv_id":"2506.20728","repositories_listed":1,"syntology":null},{"url":"/paper/2506-08558","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","date":"2025-06-10","arxiv_id":"2506.08558","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_unverified":0,"n_pointer_only":6}},{"url":"/paper/know-when-to-abstain-optimal-selective","title":"Know When to Abstain: Optimal Selective Classification with Likelihood Ratios","date":"2025-05-21","arxiv_id":"2505.15008","repositories_listed":1,"syntology":null},{"url":"/paper/vulnerability-of-transfer-learned-neural","title":"Vulnerability of Transfer-Learned Neural Networks to Data Reconstruction Attacks in Small-Data Regime","date":"2025-05-20","arxiv_id":"2505.14323","repositories_listed":1,"syntology":null},{"url":"/paper/lean-formalization-of-generalization-error","title":"Lean Formalization of Generalization Error Bound by Rademacher Complexity","date":"2025-03-25","arxiv_id":"2503.19605","repositories_listed":1,"syntology":null},{"url":"/paper/flexible-wmmse-beamforming-for-mu-mimo","title":"Flexible WMMSE Beamforming for MU-MIMO Movable Antenna Communications","date":"2025-03-22","arxiv_id":"2503.17718","repositories_listed":1,"syntology":null},{"url":"/paper/lemma-learning-from-errors-for-mathematical","title":"LEMMA: Learning from Errors for MatheMatical Advancement in LLMs","date":"2025-03-21","arxiv_id":"2503.17439","repositories_listed":1,"syntology":null},{"url":"/paper/trust-stability-and-safety-controller","title":"TRUST: Stability and Safety Controller Synthesis for Unknown Dynamical Models Using a Single Trajectory","date":"2025-03-11","arxiv_id":"2503.08081","repositories_listed":1,"syntology":null},{"url":"/paper/quality-measures-for-dynamic-graph-generative","title":"Quality Measures for Dynamic Graph Generative Models","date":"2025-03-03","arxiv_id":"2503.01720","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_unverified":0,"n_pointer_only":5}},{"url":"/paper/informativity-conditions-for-multiple-signals","title":"Informativity Conditions for Multiple Signals: Properties, Experimental Design, and Applications","date":"2025-01-17","arxiv_id":"2501.10030","repositories_listed":1,"syntology":null},{"url":"/paper/a-derivational-chainbank-for-modern-standard","title":"A Derivational ChainBank for Modern Standard Arabic","date":"2024-10-27","arxiv_id":"2410.20463","repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-multi-permutation-equivariance","title":"Revisiting Multi-Permutation Equivariance through the Lens of Irreducible Representations","date":"2024-10-09","arxiv_id":"2410.06665","repositories_listed":1,"syntology":{"n":10,"n_ran":10,"n_unverified":0,"n_pointer_only":10}},{"url":"/paper/an-accelerated-algorithm-for-stochastic","title":"An Accelerated Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","date":"2024-09-28","arxiv_id":"2409.19212","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_unverified":1,"n_pointer_only":0}},{"url":"/paper/learning-deep-dissipative-dynamics","title":"Learning Deep Dissipative Dynamics","date":"2024-08-21","arxiv_id":"2408.11479","repositories_listed":1,"syntology":null},{"url":"/paper/differentially-private-stochastic-gradient-1","title":"Differentially Private Stochastic Gradient Descent with Fixed-Size Minibatches: Tighter RDP Guarantees with or without Replacement","date":"2024-08-19","arxiv_id":"2408.10456","repositories_listed":1,"syntology":null},{"url":"/paper/a-unified-confidence-sequence-for-generalized","title":"A Unified Confidence Sequence for Generalized Linear Models, with Applications to Bandits","date":"2024-07-19","arxiv_id":"2407.13977","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_unverified":1,"n_pointer_only":2}},{"url":"/paper/a-unifying-post-processing-framework-for","title":"A Unifying Post-Processing Framework for Multi-Objective Learn-to-Defer Problems","date":"2024-07-17","arxiv_id":"2407.12710","repositories_listed":1,"syntology":{"n":7,"n_ran":3,"n_unverified":4,"n_pointer_only":0}}],"syntology_records":9,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}