{"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/scheduling/papers/3","list_of":"/task/scheduling","task":"Scheduling","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":3,"pages_in_order":32,"rows_per_page":100,"rows":[201,300],"of":3104,"counts":{"archive_papers_tagged":3104,"with_a_code_link":574,"where_syntology_ran_a_sample":107,"not_listed_spam_title":0,"listed":3104,"listed_where_code_ran":107,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":94,"every_run_a_failure_of_syntologys_instrument":13,"listed_with_a_run_with_no_instrument_failure":94,"listed_every_run_a_failure_of_syntologys_instrument":13,"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/scheduling","prev":"/task/scheduling/papers/2","next":"/task/scheduling/papers/4","papers":[{"url":"/paper/self-guided-generation-of-minority-samples","slug":"self-guided-generation-of-minority-samples","title":"Self-Guided Generation of Minority Samples Using Diffusion Models","date":"2024-07-16","arxiv_id":"2407.11555","repositories_listed":1,"syntology":{"n":18,"n_ran":15,"n_constructed":0,"n_ran_checked":9,"n_instrument":6,"n_unverified":3,"n_honours":3,"n_violates":0,"n_no_contract":6,"n_pointer_only":12,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 3 honoured, 0 violated, 6 with no contract checked; 6 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/self-guided-generation-of-minority-samples#ran","syntology_url":"https://syntology.ai/paper/2407.11555","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.11555"}},"official":{"repos":["soobin-um/sg-minority"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/biased-backpressure-routing-using-link","slug":"biased-backpressure-routing-using-link","title":"Biased Backpressure Routing Using Link Features and Graph Neural Networks","date":"2024-07-13","arxiv_id":"2407.09753","repositories_listed":1,"syntology":null},{"url":"/paper/joint-load-and-capacity-scheduling-for","slug":"joint-load-and-capacity-scheduling-for","title":"Joint Load and Capacity Scheduling for Flexible Radio Resource Management of High-Throughput Satellites","date":"2024-07-11","arxiv_id":"2407.08981","repositories_listed":1,"syntology":null},{"url":"/paper/resource-allocation-for-twin-maintenance-and","slug":"resource-allocation-for-twin-maintenance-and","title":"Resource Allocation for Twin Maintenance and Computing Task Processing in Digital Twin Vehicular Edge Computing Network","date":"2024-07-10","arxiv_id":"2407.07575","repositories_listed":1,"syntology":null},{"url":"/paper/rodinhd-high-fidelity-3d-avatar-generation","slug":"rodinhd-high-fidelity-3d-avatar-generation","title":"RodinHD: High-Fidelity 3D Avatar Generation with Diffusion Models","date":"2024-07-09","arxiv_id":"2407.06938","repositories_listed":1,"syntology":{"n":13,"n_ran":5,"n_constructed":2,"n_ran_checked":3,"n_instrument":2,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":13,"phrase":"5 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/rodinhd-high-fidelity-3d-avatar-generation#ran","syntology_url":"https://syntology.ai/paper/2407.06938","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.06938"}},"official":null}},{"url":"/paper/marlp-time-series-forecasting-control-for","slug":"marlp-time-series-forecasting-control-for","title":"MARLP: Time-series Forecasting Control for Agricultural Managed Aquifer Recharge","date":"2024-07-01","arxiv_id":"2407.01005","repositories_listed":1,"syntology":null},{"url":"/paper/a-two-stage-reinforcement-learning-based","slug":"a-two-stage-reinforcement-learning-based","title":"A Two-stage Reinforcement Learning-based Approach for Multi-entity Task Allocation","date":"2024-06-29","arxiv_id":"2407.00496","repositories_listed":1,"syntology":null},{"url":"/paper/large-language-models-for-power-scheduling-a","slug":"large-language-models-for-power-scheduling-a","title":"Large Language Models for Power Scheduling: A User-Centric Approach","date":"2024-06-29","arxiv_id":"2407.00476","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/teola-towards-end-to-end-optimization-of-llm","slug":"teola-towards-end-to-end-optimization-of-llm","title":"Teola: Towards End-to-End Optimization of LLM-based Applications","date":"2024-06-29","arxiv_id":"2407.00326","repositories_listed":1,"syntology":null},{"url":"/paper/explore-as-a-storm-exploit-as-a-raindrop-on","slug":"explore-as-a-storm-exploit-as-a-raindrop-on","title":"Explore as a Storm, Exploit as a Raindrop: On the Benefit of Fine-Tuning Kernel Schedulers with Coordinate Descent","date":"2024-06-28","arxiv_id":"2406.20037","repositories_listed":1,"syntology":null},{"url":"/paper/automatic-ai-model-selection-for-wireless","slug":"automatic-ai-model-selection-for-wireless","title":"Automatic AI Model Selection for Wireless Systems: Online Learning via Digital Twinning","date":"2024-06-22","arxiv_id":"2406.15819","repositories_listed":1,"syntology":null},{"url":"/paper/edge-llm-enabling-efficient-large-language","slug":"edge-llm-enabling-efficient-large-language","title":"EDGE-LLM: Enabling Efficient Large Language Model Adaptation on Edge Devices via Layerwise Unified Compression and Adaptive Layer Tuning and Voting","date":"2024-06-22","arxiv_id":"2406.15758","repositories_listed":1,"syntology":null},{"url":"/paper/goal-a-generalist-combinatorial-optimization","slug":"goal-a-generalist-combinatorial-optimization","title":"GOAL: A Generalist Combinatorial Optimization Agent Learning","date":"2024-06-21","arxiv_id":"2406.15079","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/goal-a-generalist-combinatorial-optimization#ran","syntology_url":"https://syntology.ai/paper/2406.15079","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.15079"}},"official":{"repos":["naver/goal-co"],"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/a-clipped-trip-the-dynamics-of-sgd-with","slug":"a-clipped-trip-the-dynamics-of-sgd-with","title":"To Clip or not to Clip: the Dynamics of SGD with Gradient Clipping in High-Dimensions","date":"2024-06-17","arxiv_id":"2406.11733","repositories_listed":1,"syntology":null},{"url":"/paper/acco-automated-causal-cnn-scheduling","slug":"acco-automated-causal-cnn-scheduling","title":"ACCO: Automated Causal CNN Scheduling Optimizer for Real-Time Edge Accelerators","date":"2024-06-11","arxiv_id":"2406.07161","repositories_listed":1,"syntology":null},{"url":"/paper/narcan-natural-refined-canonical-image-with","slug":"narcan-natural-refined-canonical-image-with","title":"NaRCan: Natural Refined Canonical Image with Integration of Diffusion Prior for Video Editing","date":"2024-06-10","arxiv_id":"2406.06523","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"0 ran · 2 unverified","sample_list":"/paper/narcan-natural-refined-canonical-image-with#ran","syntology_url":"https://syntology.ai/paper/2406.06523","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.06523"}},"official":{"repos":["koi953215/NaRCan"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/powerinfer-2-fast-large-language-model","slug":"powerinfer-2-fast-large-language-model","title":"PowerInfer-2: Fast Large Language Model Inference on a Smartphone","date":"2024-06-10","arxiv_id":"2406.06282","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/powerinfer-2-fast-large-language-model#ran","syntology_url":"https://syntology.ai/paper/2406.06282","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.06282"}},"official":null}},{"url":"/paper/differentiable-combinatorial-scheduling-at","slug":"differentiable-combinatorial-scheduling-at","title":"Differentiable Combinatorial Scheduling at Scale","date":"2024-06-06","arxiv_id":"2406.06593","repositories_listed":1,"syntology":null},{"url":"/paper/helix-distributed-serving-of-large-language","slug":"helix-distributed-serving-of-large-language","title":"Helix: Serving Large Language Models over Heterogeneous GPUs and Network via Max-Flow","date":"2024-06-03","arxiv_id":"2406.01566","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"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 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) · 0 unverified","sample_list":"/paper/helix-distributed-serving-of-large-language#ran","syntology_url":"https://syntology.ai/paper/2406.01566","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.01566"}},"official":{"repos":["Thesys-lab/Helix-ASPLOS25"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/pixelsdb-serverless-and-natural-language","slug":"pixelsdb-serverless-and-natural-language","title":"PixelsDB: Serverless and NL-Aided Data Analytics with Flexible Service Levels and Prices","date":"2024-05-30","arxiv_id":"2405.19784","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-enhanced-relation-graph-and-task","slug":"knowledge-enhanced-relation-graph-and-task","title":"Knowledge-enhanced Relation Graph and Task Sampling for Few-shot Molecular Property Prediction","date":"2024-05-24","arxiv_id":"2405.15544","repositories_listed":1,"syntology":null},{"url":"/paper/price-privacy-preserving-and-cost-effective","slug":"price-privacy-preserving-and-cost-effective","title":"PriCE: Privacy-Preserving and Cost-Effective Scheduling for Parallelizing the Large Medical Image Processing Workflow over Hybrid Clouds","date":"2024-05-24","arxiv_id":"2405.15398","repositories_listed":1,"syntology":null},{"url":"/paper/reinforcement-learning-1","slug":"reinforcement-learning-1","title":"Reinforcement learning","date":"2024-05-16","arxiv_id":"2405.10369","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/reinforcement-learning-1#ran","syntology_url":"https://syntology.ai/paper/2405.10369","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.10369"}},"official":{"repos":["sarodyatawatta/hintrl"],"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/treatment-effect-estimation-for-user-interest","slug":"treatment-effect-estimation-for-user-interest","title":"Treatment Effect Estimation for User Interest Exploration on Recommender Systems","date":"2024-05-14","arxiv_id":"2405.08582","repositories_listed":1,"syntology":null},{"url":"/paper/self-consistent-recursive-diffusion-bridge","slug":"self-consistent-recursive-diffusion-bridge","title":"Self-Consistent Recursive Diffusion Bridge for Medical Image Translation","date":"2024-05-10","arxiv_id":"2405.06789","repositories_listed":1,"syntology":null},{"url":"/paper/preble-efficient-distributed-prompt","slug":"preble-efficient-distributed-prompt","title":"Preble: Efficient Distributed Prompt Scheduling for LLM Serving","date":"2024-05-08","arxiv_id":"2407.00023","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":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) · 0 unverified","sample_list":"/paper/preble-efficient-distributed-prompt#ran","syntology_url":"https://syntology.ai/paper/2407.00023","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.00023"}},"official":{"repos":["wuklab/preble"],"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/vidur-a-large-scale-simulation-framework-for","slug":"vidur-a-large-scale-simulation-framework-for","title":"Vidur: A Large-Scale Simulation Framework For LLM Inference","date":"2024-05-08","arxiv_id":"2405.05465","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/vidur-a-large-scale-simulation-framework-for#ran","syntology_url":"https://syntology.ai/paper/2405.05465","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.05465"}},"official":{"repos":["microsoft/vidur"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/reinwifi-a-reinforcement-learning-based","slug":"reinwifi-a-reinforcement-learning-based","title":"ReinWiFi: Application-Layer QoS Optimization of WiFi Networks with Reinforcement Learning","date":"2024-05-06","arxiv_id":"2405.03526","repositories_listed":1,"syntology":null},{"url":"/paper/workbench-a-benchmark-dataset-for-agents-in-a","slug":"workbench-a-benchmark-dataset-for-agents-in-a","title":"WorkBench: a Benchmark Dataset for Agents in a Realistic Workplace Setting","date":"2024-05-01","arxiv_id":"2405.00823","repositories_listed":1,"syntology":{"n":13,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/workbench-a-benchmark-dataset-for-agents-in-a#ran","syntology_url":"https://syntology.ai/paper/2405.00823","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.00823"}},"official":{"repos":["olly-styles/workbench"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/hybrid-quantum-classical-scheduling-for","slug":"hybrid-quantum-classical-scheduling-for","title":"Q-Newton: Hybrid Quantum-Classical Scheduling for Accelerating Neural Network Training with Newton's Gradient Descent","date":"2024-04-30","arxiv_id":"2405.00252","repositories_listed":1,"syntology":null},{"url":"/paper/fine-grained-spatial-temporal-mlp","slug":"fine-grained-spatial-temporal-mlp","title":"ODMixer: Fine-grained Spatial-temporal MLP for Metro Origin-Destination Prediction","date":"2024-04-24","arxiv_id":"2404.15734","repositories_listed":1,"syntology":null},{"url":"/paper/graph-coloring-using-heat-diffusion","slug":"graph-coloring-using-heat-diffusion","title":"Graph Coloring Using Heat Diffusion","date":"2024-04-21","arxiv_id":"2404.14457","repositories_listed":1,"syntology":null},{"url":"/paper/mhlr-moving-haar-learning-rate-scheduler-for","slug":"mhlr-moving-haar-learning-rate-scheduler-for","title":"FastFace: Fast-converging Scheduler for Large-scale Face Recognition Training with One GPU","date":"2024-04-17","arxiv_id":"2404.11118","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-interactive-llm-serving-with-proxy","slug":"efficient-interactive-llm-serving-with-proxy","title":"Efficient Interactive LLM Serving with Proxy Model-based Sequence Length Prediction","date":"2024-04-12","arxiv_id":"2404.08509","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"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) · 1 unverified","sample_list":"/paper/efficient-interactive-llm-serving-with-proxy#ran","syntology_url":"https://syntology.ai/paper/2404.08509","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.08509"}},"official":{"repos":["james-qiuhaoran/llm-serving-with-proxy-models"],"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":["official"]}}},{"url":"/paper/regularized-gradient-clipping-provably-trains","slug":"regularized-gradient-clipping-provably-trains","title":"Regularized Gradient Clipping Provably Trains Wide and Deep Neural Networks","date":"2024-04-12","arxiv_id":"2404.08624","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-quantization-and-mapping-synergy-in","slug":"exploring-quantization-and-mapping-synergy-in","title":"Exploring Quantization and Mapping Synergy in Hardware-Aware Deep Neural Network Accelerators","date":"2024-04-08","arxiv_id":"2404.05368","repositories_listed":1,"syntology":null},{"url":"/paper/mineland-simulating-large-scale-multi-agent","slug":"mineland-simulating-large-scale-multi-agent","title":"MineLand: Simulating Large-Scale Multi-Agent Interactions with Limited Multimodal Senses and Physical Needs","date":"2024-03-28","arxiv_id":"2403.19267","repositories_listed":1,"syntology":null},{"url":"/paper/cobos-constraint-based-online-scheduler-for","slug":"cobos-constraint-based-online-scheduler-for","title":"CoBOS: Constraint-Based Online Scheduler for Human-Robot Collaboration","date":"2024-03-27","arxiv_id":"2403.18459","repositories_listed":1,"syntology":null},{"url":"/paper/intent-aware-drl-based-uplink-dynamic","slug":"intent-aware-drl-based-uplink-dynamic","title":"Intent-Aware DRL-Based NOMA Uplink Dynamic Scheduler for IIoT","date":"2024-03-27","arxiv_id":"2403.18364","repositories_listed":1,"syntology":null},{"url":"/paper/imitating-cost-constrained-behaviors-in","slug":"imitating-cost-constrained-behaviors-in","title":"Imitating Cost-Constrained Behaviors in Reinforcement Learning","date":"2024-03-26","arxiv_id":"2403.17456","repositories_listed":1,"syntology":null},{"url":"/paper/self-improvement-for-neural-combinatorial","slug":"self-improvement-for-neural-combinatorial","title":"Self-Improvement for Neural Combinatorial Optimization: Sample without Replacement, but Improvement","date":"2024-03-22","arxiv_id":"2403.15180","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":5,"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) · 0 unverified","sample_list":"/paper/self-improvement-for-neural-combinatorial#ran","syntology_url":"https://syntology.ai/paper/2403.15180","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.15180"}},"official":{"repos":["grimmlab/gumbeldore"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/m-hof-opt-multi-objective-hierarchical-output","slug":"m-hof-opt-multi-objective-hierarchical-output","title":"M-HOF-Opt: Multi-Objective Hierarchical Output Feedback Optimization via Multiplier Induced Loss Landscape Scheduling","date":"2024-03-20","arxiv_id":"2403.13728","repositories_listed":1,"syntology":null},{"url":"/paper/optimal-layout-synthesis-for-deep-quantum","slug":"optimal-layout-synthesis-for-deep-quantum","title":"Optimal Layout Synthesis for Deep Quantum Circuits on NISQ Processors with 100+ Qubits","date":"2024-03-18","arxiv_id":"2403.11598","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-gain-scheduling-using-reinforcement","slug":"adaptive-gain-scheduling-using-reinforcement","title":"Adaptive Gain Scheduling using Reinforcement Learning for Quadcopter Control","date":"2024-03-12","arxiv_id":"2403.07216","repositories_listed":1,"syntology":null},{"url":"/paper/characterization-of-large-language-model","slug":"characterization-of-large-language-model","title":"Characterization of Large Language Model Development in the Datacenter","date":"2024-03-12","arxiv_id":"2403.07648","repositories_listed":1,"syntology":null},{"url":"/paper/averaging-rate-scheduler-for-decentralized","slug":"averaging-rate-scheduler-for-decentralized","title":"Averaging Rate Scheduler for Decentralized Learning on Heterogeneous Data","date":"2024-03-05","arxiv_id":"2403.03292","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-solve-job-shop-scheduling-under","slug":"learning-to-solve-job-shop-scheduling-under","title":"Learning to Solve Job Shop Scheduling under Uncertainty","date":"2024-03-04","arxiv_id":"2404.01308","repositories_listed":1,"syntology":null},{"url":"/paper/taming-throughput-latency-tradeoff-in-llm","slug":"taming-throughput-latency-tradeoff-in-llm","title":"Taming Throughput-Latency Tradeoff in LLM Inference with Sarathi-Serve","date":"2024-03-04","arxiv_id":"2403.02310","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/taming-throughput-latency-tradeoff-in-llm#ran","syntology_url":"https://syntology.ai/paper/2403.02310","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.02310"}},"official":{"repos":["microsoft/sarathi-serve"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/comtraq-mpc-meta-trained-dqn-mpc-integration","slug":"comtraq-mpc-meta-trained-dqn-mpc-integration","title":"ComTraQ-MPC: Meta-Trained DQN-MPC Integration for Trajectory Tracking with Limited Active Localization Updates","date":"2024-03-03","arxiv_id":"2403.01564","repositories_listed":1,"syntology":null},{"url":"/paper/gradient-based-discrete-sampling-with","slug":"gradient-based-discrete-sampling-with","title":"Gradient-based Discrete Sampling with Automatic Cyclical Scheduling","date":"2024-02-27","arxiv_id":"2402.17699","repositories_listed":1,"syntology":{"n":16,"n_ran":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":16,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/gradient-based-discrete-sampling-with#ran","syntology_url":"https://syntology.ai/paper/2402.17699","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.17699"}},"official":{"repos":["patrickpynadath1/automatic_cyclical_sampling"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-topological-representations-with","slug":"learning-topological-representations-with","title":"Learning Topological Representations with Bidirectional Graph Attention Network for Solving Job Shop Scheduling Problem","date":"2024-02-27","arxiv_id":"2402.17606","repositories_listed":1,"syntology":null},{"url":"/paper/mspipe-efficient-temporal-gnn-training-via","slug":"mspipe-efficient-temporal-gnn-training-via","title":"MSPipe: Efficient Temporal GNN Training via Staleness-Aware Pipeline","date":"2024-02-23","arxiv_id":"2402.15113","repositories_listed":1,"syntology":null},{"url":"/paper/multi-agent-path-finding-for-cooperative","slug":"multi-agent-path-finding-for-cooperative","title":"Multi-agent Path Finding for Cooperative Autonomous Driving","date":"2024-02-01","arxiv_id":"2402.00334","repositories_listed":1,"syntology":null},{"url":"/paper/workflow-optimization-for-parallel-split","slug":"workflow-optimization-for-parallel-split","title":"Workflow Optimization for Parallel Split Learning","date":"2024-02-01","arxiv_id":"2402.10092","repositories_listed":1,"syntology":null},{"url":"/paper/serverlessllm-locality-enhanced-serverless","slug":"serverlessllm-locality-enhanced-serverless","title":"ServerlessLLM: Low-Latency Serverless Inference for Large Language Models","date":"2024-01-25","arxiv_id":"2401.14351","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/serverlessllm-locality-enhanced-serverless#ran","syntology_url":"https://syntology.ai/paper/2401.14351","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.14351"}},"official":{"repos":["serverlessllm/serverlessllm"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/states-as-strings-as-strategies-steering","slug":"states-as-strings-as-strategies-steering","title":"Steering Language Models with Game-Theoretic Solvers","date":"2024-01-24","arxiv_id":"2402.01704","repositories_listed":1,"syntology":null},{"url":"/paper/self-labeling-the-job-shop-scheduling-problem","slug":"self-labeling-the-job-shop-scheduling-problem","title":"Self-Labeling the Job Shop Scheduling Problem","date":"2024-01-22","arxiv_id":"2401.11849","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"0 ran · 2 unverified","sample_list":"/paper/self-labeling-the-job-shop-scheduling-problem#ran","syntology_url":"https://syntology.ai/paper/2401.11849","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.11849"}},"official":{"repos":["andreacorsini1/selflabelingjobshop"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/adversarial-augmentation-training-makes","slug":"adversarial-augmentation-training-makes","title":"Adversarial Augmentation Training Makes Action Recognition Models More Robust to Realistic Video Distribution Shifts","date":"2024-01-21","arxiv_id":"2401.11406","repositories_listed":1,"syntology":null},{"url":"/paper/orion-14b-open-source-multilingual-large","slug":"orion-14b-open-source-multilingual-large","title":"Orion-14B: Open-source Multilingual Large Language Models","date":"2024-01-20","arxiv_id":"2401.12246","repositories_listed":1,"syntology":null},{"url":"/paper/towards-providing-reliable-job-completion","slug":"towards-providing-reliable-job-completion","title":"Towards providing reliable job completion time predictions using PCS","date":"2024-01-18","arxiv_id":"2401.10354","repositories_listed":1,"syntology":null},{"url":"/paper/doraemongpt-toward-understanding-dynamic","slug":"doraemongpt-toward-understanding-dynamic","title":"DoraemonGPT: Toward Understanding Dynamic Scenes with Large Language Models (Exemplified as A Video Agent)","date":"2024-01-16","arxiv_id":"2401.08392","repositories_listed":1,"syntology":null},{"url":"/paper/organa-a-robotic-assistant-for-automated","slug":"organa-a-robotic-assistant-for-automated","title":"ORGANA: A Robotic Assistant for Automated Chemistry Experimentation and Characterization","date":"2024-01-13","arxiv_id":"2401.06949","repositories_listed":1,"syntology":{"n":18,"n_ran":16,"n_constructed":0,"n_ran_checked":16,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":16,"n_pointer_only":18,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 0 honoured, 0 violated, 16 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/organa-a-robotic-assistant-for-automated#ran","syntology_url":"https://syntology.ai/paper/2401.06949","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.06949"}},"official":{"repos":["ac-rad/organa"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":16,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-objective-prioritized-workflow","slug":"multi-objective-prioritized-workflow","title":"Multi Objective Prioritized Workflow Scheduling Using Deep Reinforcement Based Learning in Cloud Computing","date":"2024-01-08","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/gain-scheduling-with-a-neural-operator-for-a","slug":"gain-scheduling-with-a-neural-operator-for-a","title":"Gain Scheduling with a Neural Operator for a Transport PDE with Nonlinear Recirculation","date":"2024-01-04","arxiv_id":"2401.02511","repositories_listed":1,"syntology":null},{"url":"/paper/seamless-and-multi-resolution-energy","slug":"seamless-and-multi-resolution-energy","title":"Seamless and multi-resolution energy forecasting","date":"2023-12-28","arxiv_id":"2401.05413","repositories_listed":1,"syntology":null},{"url":"/paper/multi-agent-bandit-learning-through","slug":"multi-agent-bandit-learning-through","title":"Multi-Agent Bandit Learning through Heterogeneous Action Erasure Channels","date":"2023-12-21","arxiv_id":"2312.14259","repositories_listed":1,"syntology":null},{"url":"/paper/e2e-at-a-unified-framework-for-tackling","slug":"e2e-at-a-unified-framework-for-tackling","title":"E2E-AT: A Unified Framework for Tackling Uncertainty in Task-aware End-to-end Learning","date":"2023-12-17","arxiv_id":"2312.10587","repositories_listed":1,"syntology":null},{"url":"/paper/opara-exploiting-operator-parallelism-for","slug":"opara-exploiting-operator-parallelism-for","title":"Opara: Exploiting Operator Parallelism for Expediting DNN Inference on GPUs","date":"2023-12-16","arxiv_id":"2312.10351","repositories_listed":1,"syntology":null},{"url":"/paper/how-does-it-function-characterizing-long-term","slug":"how-does-it-function-characterizing-long-term","title":"How Does It Function? Characterizing Long-term Trends in Production Serverless Workloads","date":"2023-12-15","arxiv_id":"2312.10127","repositories_listed":1,"syntology":null},{"url":"/paper/venn-resource-management-across-federated","slug":"venn-resource-management-across-federated","title":"Venn: Resource Management for Collaborative Learning Jobs","date":"2023-12-13","arxiv_id":"2312.08298","repositories_listed":1,"syntology":null},{"url":"/paper/large-foundation-models-for-power-systems","slug":"large-foundation-models-for-power-systems","title":"Large Foundation Models for Power Systems","date":"2023-12-12","arxiv_id":"2312.07044","repositories_listed":1,"syntology":null},{"url":"/paper/dposer-diffusion-model-as-robust-3d-human","slug":"dposer-diffusion-model-as-robust-3d-human","title":"DPoser: Diffusion Model as Robust 3D Human Pose Prior","date":"2023-12-09","arxiv_id":"2312.05541","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/congestion-aware-distributed-task-offloading","slug":"congestion-aware-distributed-task-offloading","title":"Congestion-aware Distributed Task Offloading in Wireless Multi-hop Networks Using Graph Neural Networks","date":"2023-12-05","arxiv_id":"2312.02471","repositories_listed":1,"syntology":null},{"url":"/paper/age-based-scheduling-for-mobile-edge","slug":"age-based-scheduling-for-mobile-edge","title":"Age-Based Scheduling for Mobile Edge Computing: A Deep Reinforcement Learning Approach","date":"2023-12-01","arxiv_id":"2312.00279","repositories_listed":1,"syntology":null},{"url":"/paper/temperature-balancing-layer-wise-weight-1","slug":"temperature-balancing-layer-wise-weight-1","title":"Temperature Balancing, Layer-wise Weight Analysis, and Neural Network Training","date":"2023-12-01","arxiv_id":"2312.00359","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"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 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) · 0 unverified","sample_list":"/paper/temperature-balancing-layer-wise-weight-1#ran","syntology_url":"https://syntology.ai/paper/2312.00359","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.00359"}},"official":{"repos":["yefanzhou/tempbalance"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/vrem-fl-mobility-aware-computation-scheduling","slug":"vrem-fl-mobility-aware-computation-scheduling","title":"VREM-FL: Mobility-Aware Computation-Scheduling Co-Design for Vehicular Federated Learning","date":"2023-11-30","arxiv_id":"2311.18741","repositories_listed":1,"syntology":null},{"url":"/paper/zero-bubble-pipeline-parallelism","slug":"zero-bubble-pipeline-parallelism","title":"Zero Bubble Pipeline Parallelism","date":"2023-11-30","arxiv_id":"2401.10241","repositories_listed":1,"syntology":null},{"url":"/paper/gnnflow-a-distributed-framework-for-1","slug":"gnnflow-a-distributed-framework-for-1","title":"GNNFlow: A Distributed Framework for Continuous Temporal GNN Learning on Dynamic Graphs","date":"2023-11-29","arxiv_id":"2311.17410","repositories_listed":1,"syntology":null},{"url":"/paper/machine-learning-enhanced-aircraft-landing","slug":"machine-learning-enhanced-aircraft-landing","title":"Machine Learning-Enhanced Aircraft Landing Scheduling under Uncertainties","date":"2023-11-27","arxiv_id":"2311.16030","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-and-analysis-of-evolutionary","slug":"a-survey-and-analysis-of-evolutionary","title":"A Survey and Analysis of Evolutionary Operators for Permutations","date":"2023-11-24","arxiv_id":"2311.14595","repositories_listed":1,"syntology":null},{"url":"/paper/combinatorial-optimization-with-policy","slug":"combinatorial-optimization-with-policy","title":"Combinatorial Optimization with Policy Adaptation using Latent Space Search","date":"2023-11-13","arxiv_id":"2311.13569","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":7,"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) · 2 unverified","sample_list":"/paper/combinatorial-optimization-with-policy#ran","syntology_url":"https://syntology.ai/paper/2311.13569","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.13569"}},"official":{"repos":["instadeepai/compass"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/rethinking-and-benchmarking-predict-then","slug":"rethinking-and-benchmarking-predict-then","title":"Benchmarking PtO and PnO Methods in the Predictive Combinatorial Optimization Regime","date":"2023-11-13","arxiv_id":"2311.07633","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/rethinking-and-benchmarking-predict-then#ran","syntology_url":"https://syntology.ai/paper/2311.07633","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.07633"}},"official":{"repos":["thinklab-sjtu/predictiveco-benchmark"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/sampler-scheduler-for-diffusion-models","slug":"sampler-scheduler-for-diffusion-models","title":"Sampler Scheduler for Diffusion Models","date":"2023-11-12","arxiv_id":"2311.06845","repositories_listed":1,"syntology":null},{"url":"/paper/counting-manatee-aggregations-using-deep","slug":"counting-manatee-aggregations-using-deep","title":"Counting Manatee Aggregations using Deep Neural Networks and Anisotropic Gaussian Kernel","date":"2023-11-04","arxiv_id":"2311.02315","repositories_listed":1,"syntology":null},{"url":"/paper/network-contention-aware-cluster-scheduling","slug":"network-contention-aware-cluster-scheduling","title":"Network Contention-Aware Cluster Scheduling with Reinforcement Learning","date":"2023-10-31","arxiv_id":"2310.20209","repositories_listed":1,"syntology":null},{"url":"/paper/end-to-end-feature-selection-approach-for","slug":"end-to-end-feature-selection-approach-for","title":"End-to-end Feature Selection Approach for Learning Skinny Trees","date":"2023-10-28","arxiv_id":"2310.18542","repositories_listed":1,"syntology":null},{"url":"/paper/controlllm-augment-language-models-with-tools","slug":"controlllm-augment-language-models-with-tools","title":"ControlLLM: Augment Language Models with Tools by Searching on Graphs","date":"2023-10-26","arxiv_id":"2310.17796","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"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) · 0 unverified","sample_list":"/paper/controlllm-augment-language-models-with-tools#ran","syntology_url":"https://syntology.ai/paper/2310.17796","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.17796"}},"official":{"repos":["opengvlab/controlllm"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/sparse-dysta-sparsity-aware-dynamic-and","slug":"sparse-dysta-sparsity-aware-dynamic-and","title":"Sparse-DySta: Sparsity-Aware Dynamic and Static Scheduling for Sparse Multi-DNN Workloads","date":"2023-10-17","arxiv_id":"2310.11096","repositories_listed":1,"syntology":null},{"url":"/paper/imitation-learning-from-observation-with","slug":"imitation-learning-from-observation-with","title":"Imitation Learning from Observation with Automatic Discount Scheduling","date":"2023-10-11","arxiv_id":"2310.07433","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":1,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":1,"n_pointer_only":4,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 1 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/imitation-learning-from-observation-with#ran","syntology_url":"https://syntology.ai/paper/2310.07433","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.07433"}},"official":null}},{"url":"/paper/learning-a-reward-function-for-user-preferred","slug":"learning-a-reward-function-for-user-preferred","title":"Learning a Reward Function for User-Preferred Appliance Scheduling","date":"2023-10-11","arxiv_id":"2310.07389","repositories_listed":1,"syntology":null},{"url":"/paper/when-why-and-how-much-adaptive-learning-rate","slug":"when-why-and-how-much-adaptive-learning-rate","title":"Optimal Linear Decay Learning Rate Schedules and Further Refinements","date":"2023-10-11","arxiv_id":"2310.07831","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/when-why-and-how-much-adaptive-learning-rate#ran","syntology_url":"https://syntology.ai/paper/2310.07831","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.07831"}},"official":{"repos":["facebookresearch/adaptive_scheduling"],"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/twin-graph-based-anomaly-detection-via","slug":"twin-graph-based-anomaly-detection-via","title":"Twin Graph-based Anomaly Detection via Attentive Multi-Modal Learning for Microservice System","date":"2023-10-07","arxiv_id":"2310.04701","repositories_listed":1,"syntology":null},{"url":"/paper/satdm-synthesizing-realistic-satellite-image","slug":"satdm-synthesizing-realistic-satellite-image","title":"SatDM: Synthesizing Realistic Satellite Image with Semantic Layout Conditioning using Diffusion Models","date":"2023-09-28","arxiv_id":"2309.16812","repositories_listed":1,"syntology":null},{"url":"/paper/an-ai-chatbot-for-explaining-deep","slug":"an-ai-chatbot-for-explaining-deep","title":"An AI Chatbot for Explaining Deep Reinforcement Learning Decisions of Service-oriented Systems","date":"2023-09-25","arxiv_id":"2309.14391","repositories_listed":1,"syntology":null},{"url":"/paper/a-generalized-delay-and-backlog-analysis-for","slug":"a-generalized-delay-and-backlog-analysis-for","title":"A Generalized Delay and Backlog Analysis for Multiplexing URLLC and eMBB: Reconfigurable Intelligent Surfaces or Decode-and-Forward?","date":"2023-09-18","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-spatiotemporal-deep-neural-network-for-fine","slug":"a-spatiotemporal-deep-neural-network-for-fine","title":"A Spatiotemporal Deep Neural Network for Fine-Grained Multi-Horizon Wind Prediction","date":"2023-09-09","arxiv_id":"2309.04733","repositories_listed":1,"syntology":null},{"url":"/paper/cpu-frequency-scheduling-of-real-time","slug":"cpu-frequency-scheduling-of-real-time","title":"CPU frequency scheduling of real-time applications on embedded devices with temporal encoding-based deep reinforcement learning","date":"2023-09-07","arxiv_id":"2309.03779","repositories_listed":1,"syntology":null},{"url":"/paper/saturn-an-optimized-data-system-for-large","slug":"saturn-an-optimized-data-system-for-large","title":"Saturn: An Optimized Data System for Large Model Deep Learning Workloads","date":"2023-09-03","arxiv_id":"2309.01226","repositories_listed":1,"syntology":null}],"record_sha256":"ee52741b093202699ca6c1c60c8d4dd06090106bbb6991c1ada9dba44dbe991b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}