{"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/2k/papers/2","list_of":"/task/2k","task":"2k","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":3,"rows_per_page":100,"rows":[101,200],"of":288,"counts":{"archive_papers_tagged":288,"with_a_code_link":126,"where_syntology_ran_a_sample":47,"not_listed_spam_title":0,"listed":288,"listed_where_code_ran":47,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":40,"every_run_a_failure_of_syntologys_instrument":7,"listed_with_a_run_with_no_instrument_failure":40,"listed_every_run_a_failure_of_syntologys_instrument":7,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/2k","prev":"/task/2k","next":"/task/2k/papers/3","papers":[{"url":"/paper/identifying-concept-libraries-from-language","slug":"identifying-concept-libraries-from-language","title":"Identifying concept libraries from language about object structure","date":"2022-05-11","arxiv_id":"2205.05666","repositories_listed":1,"syntology":null},{"url":"/paper/any-resolution-training-for-high-resolution","slug":"any-resolution-training-for-high-resolution","title":"Any-resolution Training for High-resolution Image Synthesis","date":"2022-04-14","arxiv_id":"2204.07156","repositories_listed":1,"syntology":null},{"url":"/paper/towards-metrical-reconstruction-of-human","slug":"towards-metrical-reconstruction-of-human","title":"Towards Metrical Reconstruction of Human Faces","date":"2022-04-13","arxiv_id":"2204.06607","repositories_listed":1,"syntology":null},{"url":"/paper/faceverse-a-fine-grained-and-detail","slug":"faceverse-a-fine-grained-and-detail","title":"FaceVerse: a Fine-grained and Detail-controllable 3D Face Morphable Model from a Hybrid Dataset","date":"2022-03-26","arxiv_id":"2203.14057","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":1,"n_no_contract":4,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 1 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/faceverse-a-fine-grained-and-detail#ran","syntology_url":"https://syntology.ai/paper/2203.14057","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.14057"}},"official":{"repos":["lizhenwangt/faceverse"],"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/highly-accurate-dichotomous-image","slug":"highly-accurate-dichotomous-image","title":"Highly Accurate Dichotomous Image Segmentation","date":"2022-03-06","arxiv_id":"2203.03041","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":6,"n_ran_checked":6,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"9 ran (of which 6 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/highly-accurate-dichotomous-image#ran","syntology_url":"https://syntology.ai/paper/2203.03041","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.03041"}},"official":{"repos":["xuebinqin/DIS"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":6,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-safe-reinforcement-learning-with-a","slug":"towards-safe-reinforcement-learning-with-a","title":"Towards Safe Reinforcement Learning with a Safety Editor Policy","date":"2022-01-28","arxiv_id":"2201.12427","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/towards-safe-reinforcement-learning-with-a#ran","syntology_url":"https://syntology.ai/paper/2201.12427","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.12427"}},"official":{"repos":["hnyu/seditor"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text"]}}},{"url":"/paper/360monodepth-high-resolution-360deg-monocular-1","slug":"360monodepth-high-resolution-360deg-monocular-1","title":"360MonoDepth: High-Resolution 360deg Monocular Depth Estimation","date":"2022-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/360monodepth-high-resolution-360deg-monocular","slug":"360monodepth-high-resolution-360deg-monocular","title":"360MonoDepth: High-Resolution 360° Monocular Depth Estimation","date":"2021-11-30","arxiv_id":"2111.15669","repositories_listed":1,"syntology":{"n":13,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/360monodepth-high-resolution-360deg-monocular#ran","syntology_url":"https://syntology.ai/paper/2111.15669","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.15669"}},"official":null}},{"url":"/paper/buildingnet-learning-to-label-3d-buildings-1","slug":"buildingnet-learning-to-label-3d-buildings-1","title":"BuildingNet: Learning to Label 3D Buildings","date":"2021-10-11","arxiv_id":"2110.04955","repositories_listed":1,"syntology":null},{"url":"/paper/summarize-then-answer-generating-concise","slug":"summarize-then-answer-generating-concise","title":"Summarize-then-Answer: Generating Concise Explanations for Multi-hop Reading Comprehension","date":"2021-09-14","arxiv_id":"2109.06853","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"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) · 3 unverified","sample_list":"/paper/summarize-then-answer-generating-concise#ran","syntology_url":"https://syntology.ai/paper/2109.06853","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.06853"}},"official":{"repos":["stonybrooknlp/suqa"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/an-online-riemannian-pca-for-stochastic","slug":"an-online-riemannian-pca-for-stochastic","title":"An Online Riemannian PCA for Stochastic Canonical Correlation Analysis","date":"2021-06-08","arxiv_id":"2106.07479","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":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) · 0 unverified","sample_list":"/paper/an-online-riemannian-pca-for-stochastic#ran","syntology_url":"https://syntology.ai/paper/2106.07479","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.07479"}},"official":null}},{"url":"/paper/data-efficient-instance-generation-from","slug":"data-efficient-instance-generation-from","title":"Data-Efficient Instance Generation from Instance Discrimination","date":"2021-06-08","arxiv_id":"2106.04566","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/data-efficient-instance-generation-from#ran","syntology_url":"https://syntology.ai/paper/2106.04566","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04566"}},"official":{"repos":["genforce/insgen"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/zero-shot-fact-verification-by-claim","slug":"zero-shot-fact-verification-by-claim","title":"Zero-shot Fact Verification by Claim Generation","date":"2021-05-31","arxiv_id":"2105.14682","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"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) · 1 unverified","sample_list":"/paper/zero-shot-fact-verification-by-claim#ran","syntology_url":"https://syntology.ai/paper/2105.14682","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.14682"}},"official":{"repos":["teacherpeterpan/Zero-shot-Fact-Verification"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/transformers-generalize-deepsets-and-can-be-1","slug":"transformers-generalize-deepsets-and-can-be-1","title":"Transformers Generalize DeepSets and Can be Extended to Graphs & Hypergraphs","date":"2021-05-21","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/non-parametric-estimation-of-manifolds-from","slug":"non-parametric-estimation-of-manifolds-from","title":"Non-Parametric Estimation of Manifolds from Noisy Data","date":"2021-05-11","arxiv_id":"2105.04754","repositories_listed":1,"syntology":null},{"url":"/paper/end-to-end-speech-recognition-from-federated","slug":"end-to-end-speech-recognition-from-federated","title":"End-to-End Speech Recognition from Federated Acoustic Models","date":"2021-04-29","arxiv_id":"2104.14297","repositories_listed":1,"syntology":null},{"url":"/paper/tripartite-information-mining-and-integration","slug":"tripartite-information-mining-and-integration","title":"Tripartite Information Mining and Integration for Image Matting","date":"2021-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/meticulous-object-segmentation","slug":"meticulous-object-segmentation","title":"Meticulous Object Segmentation","date":"2020-12-13","arxiv_id":"2012.07181","repositories_listed":1,"syntology":null},{"url":"/paper/the-case-for-strong-scaling-in-deep-learning","slug":"the-case-for-strong-scaling-in-deep-learning","title":"The Case for Strong Scaling in Deep Learning: Training Large 3D CNNs with Hybrid Parallelism","date":"2020-07-25","arxiv_id":"2007.12856","repositories_listed":1,"syntology":null},{"url":"/paper/mimics-a-large-scale-data-collection-for","slug":"mimics-a-large-scale-data-collection-for","title":"MIMICS: A Large-Scale Data Collection for Search Clarification","date":"2020-06-17","arxiv_id":"2006.10174","repositories_listed":1,"syntology":null},{"url":"/paper/dual-adversarial-domain-adaptation","slug":"dual-adversarial-domain-adaptation","title":"Dual Adversarial Domain Adaptation","date":"2020-01-01","arxiv_id":"2001.00153","repositories_listed":1,"syntology":null},{"url":"/paper/fisr-deep-joint-frame-interpolation-and-super","slug":"fisr-deep-joint-frame-interpolation-and-super","title":"FISR: Deep Joint Frame Interpolation and Super-Resolution with a Multi-scale Temporal Loss","date":"2019-12-16","arxiv_id":"1912.07213","repositories_listed":1,"syntology":null},{"url":"/paper/logo-2k-a-large-scale-logo-dataset-for","slug":"logo-2k-a-large-scale-logo-dataset-for","title":"Logo-2K+: A Large-Scale Logo Dataset for Scalable Logo Classification","date":"2019-11-11","arxiv_id":"1911.07924","repositories_listed":1,"syntology":null},{"url":"/paper/learning-mixtures-of-plackett-luce-models-1","slug":"learning-mixtures-of-plackett-luce-models-1","title":"Learning Mixtures of Plackett-Luce Models from Structured Partial Orders","date":"2019-10-25","arxiv_id":"1910.11721","repositories_listed":1,"syntology":null},{"url":"/paper/accelerated-experimental-design-for-pairwise","slug":"accelerated-experimental-design-for-pairwise","title":"Accelerated Experimental Design for Pairwise Comparisons","date":"2019-01-18","arxiv_id":"1901.06080","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":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) · 3 unverified","sample_list":"/paper/accelerated-experimental-design-for-pairwise#ran","syntology_url":"https://syntology.ai/paper/1901.06080","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.06080"}},"official":{"repos":["neu-spiral/AcceleratedExperimentalDesign"],"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/orthogonal-machine-learning-power-and","slug":"orthogonal-machine-learning-power-and","title":"Orthogonal Machine Learning: Power and Limitations","date":"2017-11-01","arxiv_id":"1711.00342","repositories_listed":1,"syntology":null},{"url":null,"slug":"understanding-and-improving-length","title":"Understanding and Improving Length Generalization in Recurrent Models","date":"2025-07-03","arxiv_id":"2507.02782","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-strengthened-bound-on-the-number-of-states","title":"A strengthened bound on the number of states required to characterize maximum parsimony distance","date":"2025-06-11","arxiv_id":"2506.09888","repositories_listed":0,"syntology":null},{"url":null,"slug":"2506-08535","title":"Structured Variational $D$-Decomposition for Accurate and Stable Low-Rank Approximation","date":"2025-06-10","arxiv_id":"2506.08535","repositories_listed":0,"syntology":null},{"url":"/paper/latent-wavelet-diffusion-enabling-4k-image","slug":"latent-wavelet-diffusion-enabling-4k-image","title":"Latent Wavelet Diffusion: Enabling 4K Image Synthesis for Free","date":"2025-05-31","arxiv_id":"2506.00433","repositories_listed":0,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":1,"n_no_contract":4,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 1 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/latent-wavelet-diffusion-enabling-4k-image#ran","syntology_url":"https://syntology.ai/paper/2506.00433","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.00433"}},"official":null}},{"url":null,"slug":"tradeoffs-between-mistakes-and-erm-oracle","title":"Tradeoffs between Mistakes and ERM Oracle Calls in Online and Transductive Online Learning","date":"2025-05-30","arxiv_id":"2506.00135","repositories_listed":0,"syntology":null},{"url":null,"slug":"test-time-training-done-right","title":"Test-Time Training Done Right","date":"2025-05-29","arxiv_id":"2505.23884","repositories_listed":0,"syntology":null},{"url":null,"slug":"piivot-a-lightweight-nlp-anonymization","title":"PIIvot: A Lightweight NLP Anonymization Framework for Question-Anchored Tutoring Dialogues","date":"2025-05-22","arxiv_id":"2505.16931","repositories_listed":0,"syntology":null},{"url":null,"slug":"unlocking-the-potential-of-difficulty-prior","title":"Unlocking the Potential of Difficulty Prior in RL-based Multimodal Reasoning","date":"2025-05-19","arxiv_id":"2505.13261","repositories_listed":0,"syntology":null},{"url":null,"slug":"uishift-enhancing-vlm-based-gui-agents","title":"UIShift: Enhancing VLM-based GUI Agents through Self-supervised Reinforcement Learning","date":"2025-05-18","arxiv_id":"2505.12493","repositories_listed":0,"syntology":null},{"url":null,"slug":"aixamine-llm-safety-and-security-simplified","title":"aiXamine: Simplified LLM Safety and Security","date":"2025-04-21","arxiv_id":"2504.14985","repositories_listed":0,"syntology":null},{"url":null,"slug":"turbo2k-towards-ultra-efficient-and-high","title":"Turbo2K: Towards Ultra-Efficient and High-Quality 2K Video Synthesis","date":"2025-04-20","arxiv_id":"2504.14470","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-linear-representations-and-pretraining","title":"On Linear Representations and Pretraining Data Frequency in Language Models","date":"2025-04-16","arxiv_id":"2504.12459","repositories_listed":0,"syntology":null},{"url":null,"slug":"rethinking-the-generation-of-high-quality-cot","title":"Rethinking the Generation of High-Quality CoT Data from the Perspective of LLM-Adaptive Question Difficulty Grading","date":"2025-04-16","arxiv_id":"2504.11919","repositories_listed":0,"syntology":null},{"url":null,"slug":"seedream-3-0-technical-report","title":"Seedream 3.0 Technical Report","date":"2025-04-15","arxiv_id":"2504.11346","repositories_listed":0,"syntology":null},{"url":null,"slug":"zipir-latent-pyramid-diffusion-transformer","title":"ZipIR: Latent Pyramid Diffusion Transformer for High-Resolution Image Restoration","date":"2025-04-11","arxiv_id":"2504.08591","repositories_listed":0,"syntology":null},{"url":null,"slug":"ditfastattnv2-head-wise-attention-compression","title":"DiTFastAttnV2: Head-wise Attention Compression for Multi-Modality Diffusion Transformers","date":"2025-03-28","arxiv_id":"2503.22796","repositories_listed":0,"syntology":null},{"url":null,"slug":"nonparametric-mle-for-gaussian-location","title":"Nonparametric MLE for Gaussian Location Mixtures: Certified Computation and Generic Behavior","date":"2025-03-26","arxiv_id":"2503.20193","repositories_listed":0,"syntology":null},{"url":null,"slug":"repa-russian-error-types-annotation-for","title":"REPA: Russian Error Types Annotation for Evaluating Text Generation and Judgment Capabilities","date":"2025-03-17","arxiv_id":"2503.13102","repositories_listed":0,"syntology":null},{"url":null,"slug":"evaluating-the-suitability-of-different","title":"Evaluating the Suitability of Different Intraoral Scan Resolutions for Deep Learning-Based Tooth Segmentation","date":"2025-02-26","arxiv_id":"2502.19515","repositories_listed":0,"syntology":null},{"url":null,"slug":"stackelberg-game-preference-optimization-for","title":"Stackelberg Game Preference Optimization for Data-Efficient Alignment of Language Models","date":"2025-02-25","arxiv_id":"2502.18099","repositories_listed":0,"syntology":null},{"url":null,"slug":"correlating-and-predicting-human-evaluations","title":"Correlating and Predicting Human Evaluations of Language Models from Natural Language Processing Benchmarks","date":"2025-02-24","arxiv_id":"2502.18339","repositories_listed":0,"syntology":null},{"url":null,"slug":"exact-recovery-of-sparse-binary-vectors-from","title":"Exact Recovery of Sparse Binary Vectors from Generalized Linear Measurements","date":"2025-02-21","arxiv_id":"2502.16008","repositories_listed":0,"syntology":null},{"url":null,"slug":"facilitating-long-context-understanding-via","title":"Facilitating Long Context Understanding via Supervised Chain-of-Thought Reasoning","date":"2025-02-18","arxiv_id":"2502.13127","repositories_listed":0,"syntology":null},{"url":null,"slug":"new-rates-in-stochastic-decision-theoretic","title":"Improved Regret in Stochastic Decision-Theoretic Online Learning under Differential Privacy","date":"2025-02-16","arxiv_id":"2502.10997","repositories_listed":0,"syntology":null},{"url":null,"slug":"domaino1s-guiding-llm-reasoning-for","title":"Domaino1s: Guiding LLM Reasoning for Explainable Answers in High-Stakes Domains","date":"2025-01-24","arxiv_id":"2501.14431","repositories_listed":0,"syntology":null},{"url":null,"slug":"timelogic-a-temporal-logic-benchmark-for","title":"TimeLogic: A Temporal Logic Benchmark for Video QA","date":"2025-01-13","arxiv_id":"2501.07214","repositories_listed":0,"syntology":null},{"url":null,"slug":"longproc-benchmarking-long-context-language","title":"LongProc: Benchmarking Long-Context Language Models on Long Procedural Generation","date":"2025-01-09","arxiv_id":"2501.05414","repositories_listed":0,"syntology":null},{"url":null,"slug":"toward-corpus-size-requirements-for-training","title":"Toward Corpus Size Requirements for Training and Evaluating Depression Risk Models Using Spoken Language","date":"2024-12-31","arxiv_id":"2501.00617","repositories_listed":0,"syntology":null},{"url":null,"slug":"social-llava-enhancing-robot-navigation","title":"Social-LLaVA: Enhancing Robot Navigation through Human-Language Reasoning in Social Spaces","date":"2024-12-30","arxiv_id":"2501.09024","repositories_listed":0,"syntology":null},{"url":null,"slug":"analogxpert-automating-analog-topology","title":"AnalogXpert: Automating Analog Topology Synthesis by Incorporating Circuit Design Expertise into Large Language Models","date":"2024-12-17","arxiv_id":"2412.19824","repositories_listed":0,"syntology":null},{"url":null,"slug":"block-based-multi-scale-image-rescaling","title":"Block-Based Multi-Scale Image Rescaling","date":"2024-12-16","arxiv_id":"2412.11468","repositories_listed":0,"syntology":null},{"url":null,"slug":"do-large-language-models-show-biases-in","title":"Do Large Language Models Show Biases in Causal Learning?","date":"2024-12-13","arxiv_id":"2412.10509","repositories_listed":0,"syntology":null},{"url":null,"slug":"manta-a-large-scale-multi-view-and-visual","title":"MANTA: A Large-Scale Multi-View and Visual-Text Anomaly Detection Dataset for Tiny Objects","date":"2024-12-06","arxiv_id":"2412.04867","repositories_listed":0,"syntology":null},{"url":null,"slug":"lightweight-multiplane-images-network-for","title":"Lightweight Multiplane Images Network for Real-Time Stereoscopic Conversion from Planar Video","date":"2024-12-04","arxiv_id":"2412.03102","repositories_listed":0,"syntology":null},{"url":null,"slug":"phenome-wide-causal-proteomics-enhance","title":"Phenome-wide causal proteomics enhance systemic lupus erythematosus flare prediction: A study in Asian populations","date":"2024-11-18","arxiv_id":"2411.11915","repositories_listed":0,"syntology":null},{"url":null,"slug":"fox-1-technical-report","title":"Fox-1 Technical Report","date":"2024-11-08","arxiv_id":"2411.05281","repositories_listed":0,"syntology":null},{"url":"/paper/stem-pom-evaluating-language-models-math","slug":"stem-pom-evaluating-language-models-math","title":"STEM-POM: Evaluating Language Models Math-Symbol Reasoning in Document Parsing","date":"2024-11-01","arxiv_id":"2411.00387","repositories_listed":0,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/stem-pom-evaluating-language-models-math#ran","syntology_url":"https://syntology.ai/paper/2411.00387","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.00387"}},"official":null}},{"url":null,"slug":"bluesuffix-reinforced-blue-teaming-for-vision","title":"BlueSuffix: Reinforced Blue Teaming for Vision-Language Models Against Jailbreak Attacks","date":"2024-10-28","arxiv_id":"2410.20971","repositories_listed":0,"syntology":null},{"url":null,"slug":"coherence-driven-multimodal-safety-dialogue","title":"Coherence-Driven Multimodal Safety Dialogue with Active Learning for Embodied Agents","date":"2024-10-18","arxiv_id":"2410.14141","repositories_listed":0,"syntology":null},{"url":null,"slug":"integrating-artificial-intelligence-models","title":"Integrating Artificial Intelligence Models and Synthetic Image Data for Enhanced Asset Inspection and Defect Identification","date":"2024-10-15","arxiv_id":"2410.11967","repositories_listed":0,"syntology":null},{"url":null,"slug":"i-max-maximize-the-resolution-potential-of","title":"I-Max: Maximize the Resolution Potential of Pre-trained Rectified Flow Transformers with Projected Flow","date":"2024-10-10","arxiv_id":"2410.07536","repositories_listed":0,"syntology":null},{"url":null,"slug":"upper-and-lower-bounds-for-distributionally","title":"Upper and Lower Bounds for Distributionally Robust Off-Dynamics Reinforcement Learning","date":"2024-09-30","arxiv_id":"2409.20521","repositories_listed":0,"syntology":null},{"url":null,"slug":"study-of-subjective-and-objective-quality-in","title":"Study of Subjective and Objective Quality in Super-Resolution Enhanced Broadcast Images on a Novel SR-IQA Dataset","date":"2024-09-26","arxiv_id":"2409.17451","repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-turn-based-interfaces-synchronous-llms","title":"Beyond Turn-Based Interfaces: Synchronous LLMs as Full-Duplex Dialogue Agents","date":"2024-09-23","arxiv_id":"2409.15594","repositories_listed":0,"syntology":null},{"url":null,"slug":"csps-a-communication-efficient-sequence","title":"PecSched: Preemptive and Efficient Cluster Scheduling for LLM Inference","date":"2024-09-23","arxiv_id":"2409.15104","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-with-non-adaptive-subset-queries","title":"Clustering with Non-adaptive Subset Queries","date":"2024-09-17","arxiv_id":"2409.10908","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-much-data-is-enough-data-fine-tuning","title":"How Much Data is Enough Data? Fine-Tuning Large Language Models for In-House Translation: Performance Evaluation Across Multiple Dataset Sizes","date":"2024-09-05","arxiv_id":"2409.03454","repositories_listed":0,"syntology":null},{"url":null,"slug":"logparser-llm-advancing-efficient-log-parsing","title":"LogParser-LLM: Advancing Efficient Log Parsing with Large Language Models","date":"2024-08-25","arxiv_id":"2408.13727","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-complete-characterization-of-pairs-of","title":"A complete characterization of pairs of binary phylogenetic trees with identical $A_k$-alignments","date":"2024-08-13","arxiv_id":"2408.07011","repositories_listed":0,"syntology":null},{"url":null,"slug":"utilizing-tts-synthesized-data-for-efficient","title":"Utilizing TTS Synthesized Data for Efficient Development of Keyword Spotting Model","date":"2024-07-26","arxiv_id":"2407.18879","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-first-running-time-analysis-of-the-strength","title":"A First Running Time Analysis of the Strength Pareto Evolutionary Algorithm 2 (SPEA2)","date":"2024-06-23","arxiv_id":"2406.16116","repositories_listed":0,"syntology":null},{"url":null,"slug":"received-power-maximization-using-nonuniform","title":"Received Power Maximization Using Nonuniform Discrete Phase Shifts for RISs With a Limited Phase Range","date":"2024-06-23","arxiv_id":"2406.16210","repositories_listed":0,"syntology":null},{"url":null,"slug":"ditfastattn-attention-compression-for","title":"DiTFastAttn: Attention Compression for Diffusion Transformer Models","date":"2024-06-12","arxiv_id":"2406.08552","repositories_listed":0,"syntology":null},{"url":null,"slug":"tele-aloha-a-low-budget-and-high-authenticity","title":"Tele-Aloha: A Low-budget and High-authenticity Telepresence System Using Sparse RGB Cameras","date":"2024-05-23","arxiv_id":"2405.14866","repositories_listed":0,"syntology":null},{"url":null,"slug":"comparing-neighbors-together-makes-it-easy","title":"Comparing Neighbors Together Makes it Easy: Jointly Comparing Multiple Candidates for Efficient and Effective Retrieval","date":"2024-05-21","arxiv_id":"2405.12801","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-coarse-grained-dynamics-on-graph","title":"Learning Coarse-Grained Dynamics on Graph","date":"2024-05-15","arxiv_id":"2405.09324","repositories_listed":0,"syntology":null},{"url":null,"slug":"s-eqa-tackling-situational-queries-in","title":"Is the House Ready For Sleeptime? Generating and Evaluating Situational Queries for Embodied Question Answering","date":"2024-05-08","arxiv_id":"2405.04732","repositories_listed":0,"syntology":null},{"url":null,"slug":"regression-for-matrix-valued-data-via","title":"Regression for matrix-valued data via Kronecker products factorization","date":"2024-04-30","arxiv_id":"2404.19220","repositories_listed":0,"syntology":null},{"url":null,"slug":"ultra-high-resolution-image-synthesis-with","title":"Ultra-High-Resolution Image Synthesis with Pyramid Diffusion Model","date":"2024-03-19","arxiv_id":"2403.12915","repositories_listed":0,"syntology":null},{"url":null,"slug":"pasta-towards-flexible-and-efficient-hdr","title":"PASTA: Towards Flexible and Efficient HDR Imaging Via Progressively Aggregated Spatio-Temporal Alignment","date":"2024-03-15","arxiv_id":"2403.10376","repositories_listed":0,"syntology":null},{"url":null,"slug":"fourier-circuits-in-neural-networks-unlocking","title":"Fourier Circuits in Neural Networks and Transformers: A Case Study of Modular Arithmetic with Multiple Inputs","date":"2024-02-12","arxiv_id":"2402.09469","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-new-dataset-and-a-distractor-aware","title":"A New Dataset and a Distractor-Aware Architecture for Transparent Object Tracking","date":"2024-01-08","arxiv_id":"2401.03872","repositories_listed":0,"syntology":null},{"url":null,"slug":"capturing-closely-interacted-two-person","title":"Capturing Closely Interacted Two-Person Motions with Reaction Priors","date":"2024-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"rl-logo-deep-reinforcement-learning","title":"RL-LOGO: Deep Reinforcement Learning Localization for Logo Recognition","date":"2023-12-28","arxiv_id":"2312.16792","repositories_listed":0,"syntology":null},{"url":null,"slug":"runtime-analysis-of-the-sms-emoa-for-many","title":"Runtime Analysis of the SMS-EMOA for Many-Objective Optimization","date":"2023-12-16","arxiv_id":"2312.10290","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-novel-information-theoretic-objective-to","title":"A Novel Information-Theoretic Objective to Disentangle Representations for Fair Classification","date":"2023-10-21","arxiv_id":"2310.13990","repositories_listed":0,"syntology":null},{"url":null,"slug":"model-free-regret-optimal-best-policy","title":"Model-Free, Regret-Optimal Best Policy Identification in Online CMDPs","date":"2023-09-27","arxiv_id":"2309.15395","repositories_listed":0,"syntology":null},{"url":null,"slug":"composable-coresets-for-determinant","title":"Composable Coresets for Determinant Maximization: Greedy is Almost Optimal","date":"2023-09-26","arxiv_id":"2309.15286","repositories_listed":0,"syntology":null},{"url":null,"slug":"identification-of-mixtures-of-discrete","title":"Identification of Mixtures of Discrete Product Distributions in Near-Optimal Sample and Time Complexity","date":"2023-09-25","arxiv_id":"2309.13993","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-benchmark-for-text-expansion-datasets","title":"A Benchmark for Text Expansion: Datasets, Metrics, and Baselines","date":"2023-09-17","arxiv_id":"2309.09198","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-generalisable-and-calibrated","title":"Towards generalisable and calibrated synthetic speech detection with self-supervised representations","date":"2023-09-11","arxiv_id":"2309.05384","repositories_listed":0,"syntology":null},{"url":null,"slug":"jaccard-constrained-dense-subgraph-discovery","title":"Jaccard-constrained dense subgraph discovery","date":"2023-08-30","arxiv_id":"2308.15936","repositories_listed":0,"syntology":null},{"url":null,"slug":"medalign-a-clinician-generated-dataset-for","title":"MedAlign: A Clinician-Generated Dataset for Instruction Following with Electronic Medical Records","date":"2023-08-27","arxiv_id":"2308.14089","repositories_listed":0,"syntology":null},{"url":null,"slug":"spatially-varying-nanophotonic-neural","title":"Spatially Varying Nanophotonic Neural Networks","date":"2023-08-07","arxiv_id":"2308.03407","repositories_listed":0,"syntology":null}],"record_sha256":"96f38a2fd5ddb156868c395998d85a3eba92306a90526a31abff5d3de3102365","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}