{"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/stochastic-optimization/papers/2","list_of":"/task/stochastic-optimization","task":"Stochastic Optimization","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":14,"rows_per_page":100,"rows":[101,200],"of":1387,"counts":{"archive_papers_tagged":1387,"with_a_code_link":337,"where_syntology_ran_a_sample":91,"not_listed_spam_title":0,"listed":1387,"listed_where_code_ran":91,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":75,"every_run_a_failure_of_syntologys_instrument":16,"listed_with_a_run_with_no_instrument_failure":75,"listed_every_run_a_failure_of_syntologys_instrument":16,"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/stochastic-optimization","prev":"/task/stochastic-optimization","next":"/task/stochastic-optimization/papers/3","papers":[{"url":"/paper/a-stochastic-optimization-framework-for","slug":"a-stochastic-optimization-framework-for","title":"A Stochastic Optimization Framework for Private and Fair Learning From Decentralized Data","date":"2024-11-12","arxiv_id":"2411.07889","repositories_listed":1,"syntology":null},{"url":"/paper/effectively-leveraging-momentum-terms-in","slug":"effectively-leveraging-momentum-terms-in","title":"Effectively Leveraging Momentum Terms in Stochastic Line Search Frameworks for Fast Optimization of Finite-Sum Problems","date":"2024-11-11","arxiv_id":"2411.07102","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-consensus-gradients-aggregation-for","slug":"adaptive-consensus-gradients-aggregation-for","title":"Adaptive Consensus Gradients Aggregation for Scaled Distributed Training","date":"2024-11-06","arxiv_id":"2411.03742","repositories_listed":1,"syntology":null},{"url":"/paper/time-causal-vae-robust-financial-time-series","slug":"time-causal-vae-robust-financial-time-series","title":"Time-Causal VAE: Robust Financial Time Series Generator","date":"2024-11-05","arxiv_id":"2411.02947","repositories_listed":1,"syntology":null},{"url":"/paper/fair-and-welfare-efficient-constrained-multi","slug":"fair-and-welfare-efficient-constrained-multi","title":"Fair and Welfare-Efficient Constrained Multi-matchings under Uncertainty","date":"2024-11-04","arxiv_id":"2411.02654","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":7,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/fair-and-welfare-efficient-constrained-multi#ran","syntology_url":"https://syntology.ai/paper/2411.02654","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.02654"}},"official":{"repos":["justinpayan/RAU2"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/tuning-free-coreset-markov-chain-monte-carlo","slug":"tuning-free-coreset-markov-chain-monte-carlo","title":"Tuning-Free Coreset Markov Chain Monte Carlo via Hot DoG","date":"2024-10-24","arxiv_id":"2410.18973","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-discretization-learning-the-optimal","slug":"beyond-discretization-learning-the-optimal","title":"Beyond Discretization: Learning the Optimal Solution Path","date":"2024-10-18","arxiv_id":"2410.14885","repositories_listed":1,"syntology":null},{"url":"/paper/training-free-diffusion-model-alignment-with","slug":"training-free-diffusion-model-alignment-with","title":"Training-free Diffusion Model Alignment with Sampling Demons","date":"2024-10-08","arxiv_id":"2410.05760","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/training-free-diffusion-model-alignment-with#ran","syntology_url":"https://syntology.ai/paper/2410.05760","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.05760"}},"official":{"repos":["aiiu-lab/DemonSampling"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/non-asymptotic-convergence-analysis-of-the-1","slug":"non-asymptotic-convergence-analysis-of-the-1","title":"Non-asymptotic convergence analysis of the stochastic gradient Hamiltonian Monte Carlo algorithm with discontinuous stochastic gradient with applications to training of ReLU neural networks","date":"2024-09-25","arxiv_id":"2409.17107","repositories_listed":1,"syntology":null},{"url":"/paper/improving-tree-probability-estimation-with","slug":"improving-tree-probability-estimation-with","title":"Improving Tree Probability Estimation with Stochastic Optimization and Variance Reduction","date":"2024-09-09","arxiv_id":"2409.05282","repositories_listed":1,"syntology":null},{"url":"/paper/variational-bayesian-phylogenetic-inference-1","slug":"variational-bayesian-phylogenetic-inference-1","title":"Variational Bayesian Phylogenetic Inference with Semi-implicit Branch Length Distributions","date":"2024-08-09","arxiv_id":"2408.05058","repositories_listed":1,"syntology":null},{"url":"/paper/stochastic-variance-reduced-iterative-hard","slug":"stochastic-variance-reduced-iterative-hard","title":"Stochastic Variance-Reduced Iterative Hard Thresholding in Graph Sparsity Optimization","date":"2024-07-24","arxiv_id":"2407.16968","repositories_listed":1,"syntology":null},{"url":"/paper/randomized-physics-informed-neural-networks","slug":"randomized-physics-informed-neural-networks","title":"Randomized Physics-Informed Neural Networks for Bayesian Data Assimilation","date":"2024-07-05","arxiv_id":"2407.04617","repositories_listed":1,"syntology":null},{"url":"/paper/off-grid-ultrasound-imaging-by-stochastic","slug":"off-grid-ultrasound-imaging-by-stochastic","title":"Off-Grid Ultrasound Imaging by Stochastic Optimization","date":"2024-07-02","arxiv_id":"2407.02285","repositories_listed":1,"syntology":null},{"url":"/paper/predict-optimize-revise-on-forecast-and","slug":"predict-optimize-revise-on-forecast-and","title":"Balancing Forecast Accuracy and Switching Costs in Online Optimization of Energy Management Systems","date":"2024-06-29","arxiv_id":"2407.03368","repositories_listed":1,"syntology":null},{"url":"/paper/gradient-clipping-improves-adagrad-when-the","slug":"gradient-clipping-improves-adagrad-when-the","title":"Clipping Improves Adam-Norm and AdaGrad-Norm when the Noise Is Heavy-Tailed","date":"2024-06-06","arxiv_id":"2406.04443","repositories_listed":1,"syntology":null},{"url":"/paper/stochastic-polyak-step-sizes-and-momentum","slug":"stochastic-polyak-step-sizes-and-momentum","title":"Stochastic Polyak Step-sizes and Momentum: Convergence Guarantees and Practical Performance","date":"2024-06-06","arxiv_id":"2406.04142","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/stochastic-polyak-step-sizes-and-momentum#ran","syntology_url":"https://syntology.ai/paper/2406.04142","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.04142"}},"official":{"repos":["dimitris-oik/momsps"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-solutions-of-stochastic-optimization","slug":"learning-solutions-of-stochastic-optimization","title":"Learning Solutions of Stochastic Optimization Problems with Bayesian Neural Networks","date":"2024-06-05","arxiv_id":"2406.03082","repositories_listed":1,"syntology":null},{"url":"/paper/learning-rate-free-stochastic-optimization","slug":"learning-rate-free-stochastic-optimization","title":"Learning-Rate-Free Stochastic Optimization over Riemannian Manifolds","date":"2024-06-04","arxiv_id":"2406.02296","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/learning-rate-free-stochastic-optimization#ran","syntology_url":"https://syntology.ai/paper/2406.02296","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.02296"}},"official":{"repos":["daniel-dodd/riemannian_dog"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/ode-based-learning-to-optimize","slug":"ode-based-learning-to-optimize","title":"ODE-based Learning to Optimize","date":"2024-06-04","arxiv_id":"2406.02006","repositories_listed":1,"syntology":null},{"url":"/paper/near-optimal-decentralized-optimization-with","slug":"near-optimal-decentralized-optimization-with","title":"Towards Faster Decentralized Stochastic Optimization with Communication Compression","date":"2024-05-30","arxiv_id":"2405.20114","repositories_listed":1,"syntology":null},{"url":"/paper/bagging-improves-generalization-exponentially","slug":"bagging-improves-generalization-exponentially","title":"Subsampled Ensemble Can Improve Generalization Tail Exponentially","date":"2024-05-23","arxiv_id":"2405.14741","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-stability-of-second-order-gradient","slug":"on-the-stability-of-second-order-gradient","title":"On the stability of gradient descent with second order dynamics for time-varying cost functions","date":"2024-05-22","arxiv_id":"2405.13765","repositories_listed":1,"syntology":null},{"url":"/paper/catcma-stochastic-optimization-for-mixed","slug":"catcma-stochastic-optimization-for-mixed","title":"CatCMA : Stochastic Optimization for Mixed-Category Problems","date":"2024-05-16","arxiv_id":"2405.09962","repositories_listed":1,"syntology":null},{"url":"/paper/soul-unlocking-the-power-of-second-order","slug":"soul-unlocking-the-power-of-second-order","title":"SOUL: Unlocking the Power of Second-Order Optimization for LLM Unlearning","date":"2024-04-28","arxiv_id":"2404.18239","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":1,"n_ran_checked":2,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/soul-unlocking-the-power-of-second-order#ran","syntology_url":"https://syntology.ai/paper/2404.18239","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.18239"}},"official":{"repos":["optml-group/soul"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/coupled-generator-decomposition-for-fusion-of","slug":"coupled-generator-decomposition-for-fusion-of","title":"Coupled generator decomposition for fusion of electro- and magnetoencephalography data","date":"2024-03-02","arxiv_id":"2403.15409","repositories_listed":1,"syntology":null},{"url":"/paper/generalization-bounds-for-heavy-tailed-sdes","slug":"generalization-bounds-for-heavy-tailed-sdes","title":"Generalization Bounds for Heavy-Tailed SDEs through the Fractional Fokker-Planck Equation","date":"2024-02-12","arxiv_id":"2402.07723","repositories_listed":1,"syntology":null},{"url":"/paper/pasoa-particle-based-bayesian-optimal","slug":"pasoa-particle-based-bayesian-optimal","title":"PASOA- PArticle baSed Bayesian Optimal Adaptive design","date":"2024-02-11","arxiv_id":"2402.07160","repositories_listed":1,"syntology":{"n":16,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":9,"n_honours":0,"n_violates":2,"n_no_contract":4,"n_pointer_only":5,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 2 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/pasoa-particle-based-bayesian-optimal#ran","syntology_url":"https://syntology.ai/paper/2402.07160","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.07160"}},"official":{"repos":["iolloj/pasoa"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/diffusion-stochastic-optimization-for-min-max","slug":"diffusion-stochastic-optimization-for-min-max","title":"Diffusion Stochastic Optimization for Min-Max Problems","date":"2024-01-26","arxiv_id":"2401.14585","repositories_listed":1,"syntology":null},{"url":"/paper/stochastic-optimization-with-arbitrary","slug":"stochastic-optimization-with-arbitrary","title":"Stochastic optimization with arbitrary recurrent data sampling","date":"2024-01-15","arxiv_id":"2401.07694","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-trade-offs-in-privacy-utility-and","slug":"enhancing-trade-offs-in-privacy-utility-and","title":"Enhancing Trade-offs in Privacy, Utility, and Computational Efficiency through MUltistage Sampling Technique (MUST)","date":"2023-12-20","arxiv_id":"2312.13389","repositories_listed":1,"syntology":null},{"url":"/paper/f-ferm-a-scalable-framework-for-robust-fair","slug":"f-ferm-a-scalable-framework-for-robust-fair","title":"f-FERM: A Scalable Framework for Robust Fair Empirical Risk Minimization","date":"2023-12-06","arxiv_id":"2312.03259","repositories_listed":1,"syntology":null},{"url":"/paper/learning-from-scenarios-for-stochastic","slug":"learning-from-scenarios-for-stochastic","title":"Learning From Scenarios for Stochastic Repairable Scheduling","date":"2023-12-06","arxiv_id":"2312.03492","repositories_listed":1,"syntology":null},{"url":"/paper/breaking-the-heavy-tailed-noise-barrier-in","slug":"breaking-the-heavy-tailed-noise-barrier-in","title":"Breaking the Heavy-Tailed Noise Barrier in Stochastic Optimization Problems","date":"2023-11-07","arxiv_id":"2311.04161","repositories_listed":1,"syntology":null},{"url":"/paper/adasub-stochastic-optimization-using-second","slug":"adasub-stochastic-optimization-using-second","title":"AdaSub: Stochastic Optimization Using Second-Order Information in Low-Dimensional Subspaces","date":"2023-10-30","arxiv_id":"2310.20060","repositories_listed":1,"syntology":null},{"url":"/paper/the-acquisition-of-physical-knowledge-in","slug":"the-acquisition-of-physical-knowledge-in","title":"The Acquisition of Physical Knowledge in Generative Neural Networks","date":"2023-10-30","arxiv_id":"2310.19943","repositories_listed":1,"syntology":null},{"url":"/paper/why-do-we-need-weight-decay-in-modern-deep","slug":"why-do-we-need-weight-decay-in-modern-deep","title":"Why Do We Need Weight Decay in Modern Deep Learning?","date":"2023-10-06","arxiv_id":"2310.04415","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"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) · 0 unverified","sample_list":"/paper/why-do-we-need-weight-decay-in-modern-deep#ran","syntology_url":"https://syntology.ai/paper/2310.04415","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.04415"}},"official":{"repos":["tml-epfl/why-weight-decay"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/smoothing-methods-for-automatic","slug":"smoothing-methods-for-automatic","title":"Smoothing Methods for Automatic Differentiation Across Conditional Branches","date":"2023-10-05","arxiv_id":"2310.03585","repositories_listed":1,"syntology":null},{"url":"/paper/neural-operator-variational-inference-based","slug":"neural-operator-variational-inference-based","title":"Neural Operator Variational Inference based on Regularized Stein Discrepancy for Deep Gaussian Processes","date":"2023-09-22","arxiv_id":"2309.12658","repositories_listed":1,"syntology":null},{"url":"/paper/quasi-monte-carlo-for-3d-sliced-wasserstein","slug":"quasi-monte-carlo-for-3d-sliced-wasserstein","title":"Quasi-Monte Carlo for 3D Sliced Wasserstein","date":"2023-09-21","arxiv_id":"2309.11713","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/quasi-monte-carlo-for-3d-sliced-wasserstein#ran","syntology_url":"https://syntology.ai/paper/2309.11713","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.11713"}},"official":{"repos":["khainb/quasi-sw"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/landscape-sketch-step-an-ai-ml-based","slug":"landscape-sketch-step-an-ai-ml-based","title":"Landscape-Sketch-Step: An AI/ML-Based Metaheuristic for Surrogate Optimization Problems","date":"2023-09-14","arxiv_id":"2309.07936","repositories_listed":1,"syntology":null},{"url":"/paper/promise-preconditioned-stochastic","slug":"promise-preconditioned-stochastic","title":"PROMISE: Preconditioned Stochastic Optimization Methods by Incorporating Scalable Curvature Estimates","date":"2023-09-05","arxiv_id":"2309.02014","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/promise-preconditioned-stochastic#ran","syntology_url":"https://syntology.ai/paper/2309.02014","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.02014"}},"official":{"repos":["udellgroup/promise"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/likelihood-based-inference-and-forecasting","slug":"likelihood-based-inference-and-forecasting","title":"Likelihood-based inference and forecasting for trawl processes: a stochastic optimization approach","date":"2023-08-30","arxiv_id":"2308.16092","repositories_listed":1,"syntology":null},{"url":"/paper/integrating-llms-and-decision-transformers","slug":"integrating-llms-and-decision-transformers","title":"Integrating LLMs and Decision Transformers for Language Grounded Generative Quality-Diversity","date":"2023-08-25","arxiv_id":"2308.13278","repositories_listed":1,"syntology":null},{"url":"/paper/serverless-federated-auprc-optimization-for","slug":"serverless-federated-auprc-optimization-for","title":"Serverless Federated AUPRC Optimization for Multi-Party Collaborative Imbalanced Data Mining","date":"2023-08-06","arxiv_id":"2308.03035","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"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) · 1 unverified","sample_list":"/paper/serverless-federated-auprc-optimization-for#ran","syntology_url":"https://syntology.ai/paper/2308.03035","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.03035"}},"official":{"repos":["xidongwu/d-auprc"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/monte-carlo-policy-gradient-method-for-binary","slug":"monte-carlo-policy-gradient-method-for-binary","title":"Monte Carlo Policy Gradient Method for Binary Optimization","date":"2023-07-03","arxiv_id":"2307.00783","repositories_listed":1,"syntology":null},{"url":"/paper/binaryvit-pushing-binary-vision-transformers","slug":"binaryvit-pushing-binary-vision-transformers","title":"BinaryViT: Pushing Binary Vision Transformers Towards Convolutional Models","date":"2023-06-29","arxiv_id":"2306.16678","repositories_listed":1,"syntology":null},{"url":"/paper/neural-inventory-control-in-networks-via","slug":"neural-inventory-control-in-networks-via","title":"Neural Inventory Control in Networks via Hindsight Differentiable Policy Optimization","date":"2023-06-20","arxiv_id":"2306.11246","repositories_listed":1,"syntology":null},{"url":"/paper/noise-stability-optimization-for-flat-minima","slug":"noise-stability-optimization-for-flat-minima","title":"Noise Stability Optimization for Finding Flat Minima: A Hessian-based Regularization Approach","date":"2023-06-14","arxiv_id":"2306.08553","repositories_listed":1,"syntology":{"n":15,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":0,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/noise-stability-optimization-for-flat-minima#ran","syntology_url":"https://syntology.ai/paper/2306.08553","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.08553"}},"official":{"repos":["virtuosoresearch/noise-stability-optimization"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/provably-personalized-and-robust-federated","slug":"provably-personalized-and-robust-federated","title":"Provably Personalized and Robust Federated Learning","date":"2023-06-14","arxiv_id":"2306.08393","repositories_listed":1,"syntology":null},{"url":"/paper/end-to-end-learning-for-stochastic","slug":"end-to-end-learning-for-stochastic","title":"End-to-End Learning for Stochastic Optimization: A Bayesian Perspective","date":"2023-06-07","arxiv_id":"2306.04174","repositories_listed":1,"syntology":null},{"url":"/paper/kradagrad-kronecker-approximation-domination","slug":"kradagrad-kronecker-approximation-domination","title":"KrADagrad: Kronecker Approximation-Domination Gradient Preconditioned Stochastic Optimization","date":"2023-05-30","arxiv_id":"2305.19416","repositories_listed":1,"syntology":null},{"url":"/paper/neural-characteristic-activation-value","slug":"neural-characteristic-activation-value","title":"Neural Characteristic Activation Analysis and Geometric Parameterization for ReLU Networks","date":"2023-05-25","arxiv_id":"2305.15912","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/neural-characteristic-activation-value#ran","syntology_url":"https://syntology.ai/paper/2305.15912","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.15912"}},"official":{"repos":["Wenlin-Chen/geometric-parameterization"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/winner-take-all-column-row-sampling-for","slug":"winner-take-all-column-row-sampling-for","title":"Winner-Take-All Column Row Sampling for Memory Efficient Adaptation of Language Model","date":"2023-05-24","arxiv_id":"2305.15265","repositories_listed":1,"syntology":null},{"url":"/paper/provable-multi-instance-deep-auc-maximization","slug":"provable-multi-instance-deep-auc-maximization","title":"Provable Multi-instance Deep AUC Maximization with Stochastic Pooling","date":"2023-05-14","arxiv_id":"2305.08040","repositories_listed":1,"syntology":null},{"url":"/paper/momo-momentum-models-for-adaptive-learning","slug":"momo-momentum-models-for-adaptive-learning","title":"MoMo: Momentum Models for Adaptive Learning Rates","date":"2023-05-12","arxiv_id":"2305.07583","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/momo-momentum-models-for-adaptive-learning#ran","syntology_url":"https://syntology.ai/paper/2305.07583","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.07583"}},"official":{"repos":["fabian-sp/MoMo"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-variational-perspective-on-solving-inverse","slug":"a-variational-perspective-on-solving-inverse","title":"A Variational Perspective on Solving Inverse Problems with Diffusion Models","date":"2023-05-07","arxiv_id":"2305.04391","repositories_listed":1,"syntology":null},{"url":"/paper/decouple-graph-neural-networks-train-multiple","slug":"decouple-graph-neural-networks-train-multiple","title":"Decouple Graph Neural Networks: Train Multiple Simple GNNs Simultaneously Instead of One","date":"2023-04-20","arxiv_id":"2304.10126","repositories_listed":1,"syntology":null},{"url":"/paper/estimate-then-optimize-versus-integrated","slug":"estimate-then-optimize-versus-integrated","title":"Estimate-Then-Optimize versus Integrated-Estimation-Optimization versus Sample Average Approximation: A Stochastic Dominance Perspective","date":"2023-04-13","arxiv_id":"2304.06833","repositories_listed":1,"syntology":null},{"url":"/paper/black-box-variational-inference-with-a","slug":"black-box-variational-inference-with-a","title":"Black Box Variational Inference with a Deterministic Objective: Faster, More Accurate, and Even More Black Box","date":"2023-04-11","arxiv_id":"2304.05527","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/black-box-variational-inference-with-a#ran","syntology_url":"https://syntology.ai/paper/2304.05527","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.05527"}},"official":{"repos":["rgiordan/dadvipaper"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/combinatorial-optimization-enriched-machine","slug":"combinatorial-optimization-enriched-machine","title":"Combinatorial Optimization enriched Machine Learning to solve the Dynamic Vehicle Routing Problem with Time Windows","date":"2023-04-03","arxiv_id":"2304.00789","repositories_listed":1,"syntology":{"n":21,"n_ran":14,"n_constructed":2,"n_ran_checked":9,"n_instrument":5,"n_unverified":7,"n_honours":5,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"14 ran (of which 2 constructed an object rather than computing a result; 9 with no instrument failure: 5 honoured, 0 violated, 4 with no contract checked; 5 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/combinatorial-optimization-enriched-machine#ran","syntology_url":"https://syntology.ai/paper/2304.00789","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.00789"}},"official":{"repos":["tumbais/euro-meets-neurips-2022"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":2,"n_ran_no_instrument_failure":9,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/n-step-temporal-difference-learning-with","slug":"n-step-temporal-difference-learning-with","title":"n-Step Temporal Difference Learning with Optimal n","date":"2023-03-13","arxiv_id":"2303.07068","repositories_listed":1,"syntology":null},{"url":"/paper/natural-gradient-hybrid-variational-inference","slug":"natural-gradient-hybrid-variational-inference","title":"Natural Gradient Hybrid Variational Inference with Application to Deep Mixed Models","date":"2023-02-27","arxiv_id":"2302.13536","repositories_listed":1,"syntology":null},{"url":"/paper/variational-linearized-laplace-approximation","slug":"variational-linearized-laplace-approximation","title":"Variational Linearized Laplace Approximation for Bayesian Deep Learning","date":"2023-02-24","arxiv_id":"2302.12565","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/variational-linearized-laplace-approximation#ran","syntology_url":"https://syntology.ai/paper/2302.12565","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.12565"}},"official":{"repos":["ludvins/variational-lla"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/target-based-surrogates-for-stochastic","slug":"target-based-surrogates-for-stochastic","title":"Target-based Surrogates for Stochastic Optimization","date":"2023-02-06","arxiv_id":"2302.02607","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/target-based-surrogates-for-stochastic#ran","syntology_url":"https://syntology.ai/paper/2302.02607","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.02607"}},"official":{"repos":["wilderlavington/target-based-surrogates-for-stochastic-optimization"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/optimal-planning-of-hybrid-energy-storage","slug":"optimal-planning-of-hybrid-energy-storage","title":"Optimal Planning of Hybrid Energy Storage Systems using Curtailed Renewable Energy through Deep Reinforcement Learning","date":"2022-12-12","arxiv_id":"2212.05662","repositories_listed":1,"syntology":null},{"url":"/paper/stochastic-first-order-learning-for-large","slug":"stochastic-first-order-learning-for-large","title":"Stochastic First-Order Learning for Large-Scale Flexibly Tied Gaussian Mixture Model","date":"2022-12-11","arxiv_id":"2212.05402","repositories_listed":1,"syntology":null},{"url":"/paper/stochastic-optimization-for-spectral-risk","slug":"stochastic-optimization-for-spectral-risk","title":"Stochastic Optimization for Spectral Risk Measures","date":"2022-12-10","arxiv_id":"2212.05149","repositories_listed":1,"syntology":null},{"url":"/paper/a-simple-and-efficient-stochastic-algorithm","slug":"a-simple-and-efficient-stochastic-algorithm","title":"An Efficient Stochastic Algorithm for Decentralized Nonconvex-Strongly-Concave Minimax Optimization","date":"2022-12-05","arxiv_id":"2212.02387","repositories_listed":1,"syntology":null},{"url":"/paper/end-to-end-stochastic-optimization-with","slug":"end-to-end-stochastic-optimization-with","title":"End-to-End Stochastic Optimization with Energy-Based Model","date":"2022-11-25","arxiv_id":"2211.13837","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/end-to-end-stochastic-optimization-with#ran","syntology_url":"https://syntology.ai/paper/2211.13837","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.13837"}},"official":{"repos":["Lingkai-Kong/SO-EBM"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/sketchysgd-reliable-stochastic-optimization","slug":"sketchysgd-reliable-stochastic-optimization","title":"SketchySGD: Reliable Stochastic Optimization via Randomized Curvature Estimates","date":"2022-11-16","arxiv_id":"2211.08597","repositories_listed":1,"syntology":null},{"url":"/paper/rffnet-scalable-and-interpretable-kernel","slug":"rffnet-scalable-and-interpretable-kernel","title":"RFFNet: Large-Scale Interpretable Kernel Methods via Random Fourier Features","date":"2022-11-11","arxiv_id":"2211.06410","repositories_listed":1,"syntology":null},{"url":"/paper/langevin-dynamics-based-algorithm-e-th","slug":"langevin-dynamics-based-algorithm-e-th","title":"Langevin dynamics based algorithm e-TH$\\varepsilon$O POULA for stochastic optimization problems with discontinuous stochastic gradient","date":"2022-10-24","arxiv_id":"2210.13193","repositories_listed":1,"syntology":null},{"url":"/paper/on-demand-sampling-learning-optimally-from","slug":"on-demand-sampling-learning-optimally-from","title":"On-Demand Sampling: Learning Optimally from Multiple Distributions","date":"2022-10-22","arxiv_id":"2210.12529","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/on-demand-sampling-learning-optimally-from#ran","syntology_url":"https://syntology.ai/paper/2210.12529","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.12529"}},"official":{"repos":["ericzhao28/multidistributionlearning"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/stochastic-differentially-private-and-fair","slug":"stochastic-differentially-private-and-fair","title":"Stochastic Differentially Private and Fair Learning","date":"2022-10-17","arxiv_id":"2210.08781","repositories_listed":1,"syntology":null},{"url":"/paper/a-dual-control-variate-for-doubly-stochastic","slug":"a-dual-control-variate-for-doubly-stochastic","title":"Joint control variate for faster black-box variational inference","date":"2022-10-13","arxiv_id":"2210.07290","repositories_listed":1,"syntology":null},{"url":"/paper/rieoptax-riemannian-optimization-in-jax","slug":"rieoptax-riemannian-optimization-in-jax","title":"Rieoptax: Riemannian Optimization in JAX","date":"2022-10-10","arxiv_id":"2210.04840","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-the-algorithm-dependent","slug":"exploring-the-algorithm-dependent","title":"Exploring the Algorithm-Dependent Generalization of AUPRC Optimization with List Stability","date":"2022-09-27","arxiv_id":"2209.13262","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-counter-stochastic-feature-based","slug":"learning-to-counter-stochastic-feature-based","title":"Feature-based Learning for Diverse and Privacy-Preserving Counterfactual Explanations","date":"2022-09-27","arxiv_id":"2209.13446","repositories_listed":1,"syntology":null},{"url":"/paper/stochastic-gradient-descent-captures-how","slug":"stochastic-gradient-descent-captures-how","title":"Stochastic Gradient Descent Captures How Children Learn About Physics","date":"2022-09-25","arxiv_id":"2209.12344","repositories_listed":1,"syntology":null},{"url":"/paper/defense-against-privacy-leakage-in-federated","slug":"defense-against-privacy-leakage-in-federated","title":"Concealing Sensitive Samples against Gradient Leakage in Federated Learning","date":"2022-09-13","arxiv_id":"2209.05724","repositories_listed":1,"syntology":null},{"url":"/paper/annealing-optimization-for-progressive","slug":"annealing-optimization-for-progressive","title":"Annealing Optimization for Progressive Learning with Stochastic Approximation","date":"2022-09-06","arxiv_id":"2209.02826","repositories_listed":1,"syntology":null},{"url":"/paper/near-optimal-algorithms-for-making-the","slug":"near-optimal-algorithms-for-making-the","title":"Near-Optimal Algorithms for Making the Gradient Small in Stochastic Minimax Optimization","date":"2022-08-11","arxiv_id":"2208.05925","repositories_listed":1,"syntology":null},{"url":"/paper/sgem-stochastic-gradient-with-energy-and","slug":"sgem-stochastic-gradient-with-energy-and","title":"SGEM: stochastic gradient with energy and momentum","date":"2022-08-03","arxiv_id":"2208.02208","repositories_listed":1,"syntology":null},{"url":"/paper/planning-sequential-tasks-on-contact-graph","slug":"planning-sequential-tasks-on-contact-graph","title":"Sequential Manipulation Planning on Scene Graph","date":"2022-07-10","arxiv_id":"2207.04364","repositories_listed":1,"syntology":null},{"url":"/paper/asymptotic-convergence-rate-and-statistical","slug":"asymptotic-convergence-rate-and-statistical","title":"Statistical Inference of Constrained Stochastic Optimization via Sketched Sequential Quadratic Programming","date":"2022-05-27","arxiv_id":"2205.13687","repositories_listed":1,"syntology":null},{"url":"/paper/predictor-corrector-algorithms-for-stochastic","slug":"predictor-corrector-algorithms-for-stochastic","title":"Predictor-corrector algorithms for stochastic optimization under gradual distribution shift","date":"2022-05-26","arxiv_id":"2205.13575","repositories_listed":1,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/predictor-corrector-algorithms-for-stochastic#ran","syntology_url":"https://syntology.ai/paper/2205.13575","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.13575"}},"official":{"repos":["smaityumich/concept-drift"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-stochastic-optimization-in-finance","slug":"deep-stochastic-optimization-in-finance","title":"Deep Stochastic Optimization in Finance","date":"2022-05-09","arxiv_id":"2205.04604","repositories_listed":1,"syntology":null},{"url":"/paper/an-online-stochastic-optimization-approach","slug":"an-online-stochastic-optimization-approach","title":"An Online Stochastic Optimization Approach for Insulin Intensification in Type 2 Diabetes with Attention to Pseudo-Hypoglycemia","date":"2022-04-24","arxiv_id":"2204.11380","repositories_listed":1,"syntology":null},{"url":"/paper/paoding-supervised-robustness-preserving-data","slug":"paoding-supervised-robustness-preserving-data","title":"Supervised Robustness-preserving Data-free Neural Network Pruning","date":"2022-04-02","arxiv_id":"2204.00783","repositories_listed":1,"syntology":null},{"url":"/paper/robust-automated-and-accurate-black-box","slug":"robust-automated-and-accurate-black-box","title":"A Framework for Improving the Reliability of Black-box Variational Inference","date":"2022-03-29","arxiv_id":"2203.15945","repositories_listed":1,"syntology":null},{"url":"/paper/risk-consistent-multi-class-learning-from","slug":"risk-consistent-multi-class-learning-from","title":"Learning from Label Proportions with Instance-wise Consistency","date":"2022-03-24","arxiv_id":"2203.12836","repositories_listed":1,"syntology":null},{"url":"/paper/socially-fair-mitigation-of-misinformation-on","slug":"socially-fair-mitigation-of-misinformation-on","title":"Socially Fair Mitigation of Misinformation on Social Networks via Constraint Stochastic Optimization","date":"2022-03-23","arxiv_id":"2203.12537","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/socially-fair-mitigation-of-misinformation-on#ran","syntology_url":"https://syntology.ai/paper/2203.12537","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.12537"}},"official":{"repos":["ahmed-abouzeid/mmss"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/comparing-two-samples-through-stochastic","slug":"comparing-two-samples-through-stochastic","title":"Comparing Two Samples Through Stochastic Dominance: A Graphical Approach","date":"2022-03-15","arxiv_id":"2203.07889","repositories_listed":1,"syntology":null},{"url":"/paper/recursive-monte-carlo-and-variational","slug":"recursive-monte-carlo-and-variational","title":"Recursive Monte Carlo and Variational Inference with Auxiliary Variables","date":"2022-03-05","arxiv_id":"2203.02836","repositories_listed":1,"syntology":null},{"url":"/paper/large-scale-stochastic-optimization-of-ndcg","slug":"large-scale-stochastic-optimization-of-ndcg","title":"Large-scale Stochastic Optimization of NDCG Surrogates for Deep Learning with Provable Convergence","date":"2022-02-24","arxiv_id":"2202.12183","repositories_listed":1,"syntology":null},{"url":"/paper/provable-stochastic-optimization-for-global","slug":"provable-stochastic-optimization-for-global","title":"Provable Stochastic Optimization for Global Contrastive Learning: Small Batch Does Not Harm Performance","date":"2022-02-24","arxiv_id":"2202.12387","repositories_listed":1,"syntology":null},{"url":"/paper/mining-the-manifolds-of-deep-generative","slug":"mining-the-manifolds-of-deep-generative","title":"Mining the manifolds of deep generative models for multiple data-consistent solutions of ill-posed tomographic imaging problems","date":"2022-02-10","arxiv_id":"2202.05311","repositories_listed":1,"syntology":null},{"url":"/paper/personalization-improves-privacy-accuracy","slug":"personalization-improves-privacy-accuracy","title":"Personalization Improves Privacy-Accuracy Tradeoffs in Federated Learning","date":"2022-02-10","arxiv_id":"2202.05318","repositories_listed":1,"syntology":null},{"url":"/paper/adapting-to-mixing-time-in-stochastic","slug":"adapting-to-mixing-time-in-stochastic","title":"Adapting to Mixing Time in Stochastic Optimization with Markovian Data","date":"2022-02-09","arxiv_id":"2202.04428","repositories_listed":1,"syntology":null}],"record_sha256":"ce45c70cc37868c0638b7267ee548c36130fd9fb6c9d4ef901cc4815bed175b9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}