{"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/data-summarization","name":"Data Summarization","slug":"data-summarization","description_markdown":"**Data Summarization** is a central problem in the area of machine learning, where we want to compute a small summary of the data.\n\n\n<span class=\"description-source\">Source: [How to Solve Fair k-Center in Massive Data Models ](https://arxiv.org/abs/2002.07682)</span>","categories":[{"name":"Miscellaneous","url":"/area/miscellaneous"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":97,"papers_with_code":34,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":3,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[{"url":"/dataset/mentsum","name":"MentSum","full_name":"Mental Health Summarization Dataset","num_papers_in_archive":2},{"url":"/dataset/m3ls-multi-lingual-multi-modal-summarization","name":"M3LS","full_name":"Multi-Lingual Multi-Modal Summarization Dataset","num_papers_in_archive":1},{"url":"/dataset/pjm-aep","name":"PJM(AEP)","full_name":"","num_papers_in_archive":0}],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":97,"of":97,"of_with_code":34,"tagged_in_all":97,"counts":{"archive_papers_tagged":97,"with_a_code_link":34,"where_syntology_ran_a_sample":8,"not_listed_spam_title":0,"listed":97,"listed_where_code_ran":8,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":8,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":8,"listed_every_run_a_failure_of_syntologys_instrument":0,"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"},"items":[{"url":"/paper/improving-dataset-distillation","slug":"improving-dataset-distillation","title":"Soft-Label Dataset Distillation and Text Dataset Distillation","date":"2019-10-06","arxiv_id":"1910.02551","repositories_listed":3,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/improving-dataset-distillation#ran","syntology_url":"https://syntology.ai/paper/1910.02551","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.02551"}},"official":{"repos":["ilia10000/dataset-distillation"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/sequential-estimation-of-nonparametric","slug":"sequential-estimation-of-nonparametric","title":"Sequential estimation of Spearman rank correlation using Hermite series estimators","date":"2020-12-11","arxiv_id":"2012.06287","repositories_listed":2,"syntology":null},{"url":"/paper/flexible-dataset-distillation-learn-labels","slug":"flexible-dataset-distillation-learn-labels","title":"Flexible Dataset Distillation: Learn Labels Instead of Images","date":"2020-06-15","arxiv_id":"2006.08572","repositories_listed":2,"syntology":{"n":14,"n_ran":12,"n_constructed":8,"n_ran_checked":9,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"12 ran (of which 8 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/flexible-dataset-distillation-learn-labels#ran","syntology_url":"https://syntology.ai/paper/2006.08572","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.08572"}},"official":{"repos":["ondrejbohdal/label-distillation"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":8,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/iterative-projection-and-matching-finding","slug":"iterative-projection-and-matching-finding","title":"Iterative Projection and Matching: Finding Structure-preserving Representatives and Its Application to Computer Vision","date":"2018-11-29","arxiv_id":"1811.12326","repositories_listed":2,"syntology":null},{"url":"/paper/get-rid-of-task-isolation-a-continuous-multi","slug":"get-rid-of-task-isolation-a-continuous-multi","title":"Get Rid of Isolation: A Continuous Multi-task Spatio-Temporal Learning Framework","date":"2024-10-14","arxiv_id":"2410.10524","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":3,"n_instrument":6,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 6 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/get-rid-of-task-isolation-a-continuous-multi#ran","syntology_url":"https://syntology.ai/paper/2410.10524","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.10524"}},"official":{"repos":["dilab-ustcsz/cmust"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/diffred-dimensionality-reduction-guided-by","slug":"diffred-dimensionality-reduction-guided-by","title":"DiffRed: Dimensionality Reduction guided by stable rank","date":"2024-03-09","arxiv_id":"2403.05882","repositories_listed":1,"syntology":null},{"url":"/paper/time-to-pattern-information-theoretic","slug":"time-to-pattern-information-theoretic","title":"Time-to-Pattern: Information-Theoretic Unsupervised Learning for Scalable Time Series Summarization","date":"2023-08-26","arxiv_id":"2308.13722","repositories_listed":1,"syntology":null},{"url":"/paper/chartsumm-a-comprehensive-benchmark-for","slug":"chartsumm-a-comprehensive-benchmark-for","title":"ChartSumm: A Comprehensive Benchmark for Automatic Chart Summarization of Long and Short Summaries","date":"2023-04-26","arxiv_id":"2304.13620","repositories_listed":1,"syntology":null},{"url":"/paper/matcha-enhancing-visual-language-pretraining","slug":"matcha-enhancing-visual-language-pretraining","title":"MatCha: Enhancing Visual Language Pretraining with Math Reasoning and Chart Derendering","date":"2022-12-19","arxiv_id":"2212.09662","repositories_listed":1,"syntology":null},{"url":"/paper/black-box-coreset-variational-inference","slug":"black-box-coreset-variational-inference","title":"Black-box Coreset Variational Inference","date":"2022-11-04","arxiv_id":"2211.02377","repositories_listed":1,"syntology":null},{"url":"/paper/balancing-utility-and-fairness-in-submodular","slug":"balancing-utility-and-fairness-in-submodular","title":"Balancing Utility and Fairness in Submodular Maximization (Technical Report)","date":"2022-11-02","arxiv_id":"2211.00980","repositories_listed":1,"syntology":null},{"url":"/paper/streaming-algorithms-for-diversity","slug":"streaming-algorithms-for-diversity","title":"Streaming Algorithms for Diversity Maximization with Fairness Constraints","date":"2022-07-30","arxiv_id":"2208.00194","repositories_listed":1,"syntology":null},{"url":"/paper/towards-neural-numeric-to-text-generation","slug":"towards-neural-numeric-to-text-generation","title":"Towards Neural Numeric-To-Text Generation From Temporal Personal Health Data","date":"2022-07-11","arxiv_id":"2207.05194","repositories_listed":1,"syntology":null},{"url":"/paper/group-fairness-in-adaptive-submodular","slug":"group-fairness-in-adaptive-submodular","title":"Group Equality in Adaptive Submodular Maximization","date":"2022-07-07","arxiv_id":"2207.03364","repositories_listed":1,"syntology":null},{"url":"/paper/submodlib-a-submodular-optimization-library","slug":"submodlib-a-submodular-optimization-library","title":"Submodlib: A Submodular Optimization Library","date":"2022-02-22","arxiv_id":"2202.10680","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/submodlib-a-submodular-optimization-library#ran","syntology_url":"https://syntology.ai/paper/2202.10680","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.10680"}},"official":{"repos":["decile-team/submodlib"],"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/synthetic-dataset-generation-of-driver","slug":"synthetic-dataset-generation-of-driver","title":"Synthetic Dataset Generation of Driver Telematics","date":"2021-01-30","arxiv_id":"2102.00252","repositories_listed":1,"syntology":null},{"url":"/paper/very-fast-streaming-submodular-function","slug":"very-fast-streaming-submodular-function","title":"Very Fast Streaming Submodular Function Maximization","date":"2020-10-20","arxiv_id":"2010.10059","repositories_listed":1,"syntology":null},{"url":"/paper/semi-supervised-batch-active-learning-via","slug":"semi-supervised-batch-active-learning-via","title":"Semi-supervised Batch Active Learning via Bilevel Optimization","date":"2020-10-19","arxiv_id":"2010.09654","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/semi-supervised-batch-active-learning-via#ran","syntology_url":"https://syntology.ai/paper/2010.09654","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.09654"}},"official":{"repos":["zalanborsos/bilevel_coresets"],"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/streaming-submodular-maximization-with","slug":"streaming-submodular-maximization-with","title":"Fair and Representative Subset Selection from Data Streams","date":"2020-10-09","arxiv_id":"2010.04412","repositories_listed":1,"syntology":null},{"url":"/paper/b-cores-robust-large-scale-bayesian-data","slug":"b-cores-robust-large-scale-bayesian-data","title":"$β$-Cores: Robust Large-Scale Bayesian Data Summarization in the Presence of Outliers","date":"2020-08-31","arxiv_id":"2008.13600","repositories_listed":1,"syntology":null},{"url":"/paper/anova-exemplars-for-understanding-data-drift","slug":"anova-exemplars-for-understanding-data-drift","title":"Understanding collections of related datasets using dependent MMD coresets","date":"2020-06-24","arxiv_id":"2006.14621","repositories_listed":1,"syntology":null},{"url":"/paper/deuteros-2-0-peptide-level-significance","slug":"deuteros-2-0-peptide-level-significance","title":"Deuteros 2.0: Peptide-level significance testing of data from hydrogen deuterium exchange mass spectrometry","date":"2020-05-17","arxiv_id":"2005.08380","repositories_listed":1,"syntology":null},{"url":"/paper/co-optimal-transport","slug":"co-optimal-transport","title":"CO-Optimal Transport","date":"2020-02-10","arxiv_id":"2002.03731","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/co-optimal-transport#ran","syntology_url":"https://syntology.ai/paper/2002.03731","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.03731"}},"official":{"repos":["PythonOT/COOT"],"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/streaming-submodular-maximization-under-a-k","slug":"streaming-submodular-maximization-under-a-k","title":"Streaming Submodular Maximization under a $k$-Set System Constraint","date":"2020-02-09","arxiv_id":"2002.03352","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/streaming-submodular-maximization-under-a-k#ran","syntology_url":"https://syntology.ai/paper/2002.03352","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.03352"}},"official":null}},{"url":"/paper/an-empirical-and-comparative-analysis-of-data-1","slug":"an-empirical-and-comparative-analysis-of-data-1","title":"Scalability vs. Utility: Do We Have to Sacrifice One for the Other in Data Importance Quantification?","date":"2019-11-17","arxiv_id":"1911.07128","repositories_listed":1,"syntology":null},{"url":"/paper/fast-and-accurate-least-mean-squares-solvers","slug":"fast-and-accurate-least-mean-squares-solvers","title":"Fast and Accurate Least-Mean-Squares Solvers","date":"2019-06-11","arxiv_id":"1906.04705","repositories_listed":1,"syntology":null},{"url":"/paper/apricot-submodular-selection-for-data","slug":"apricot-submodular-selection-for-data","title":"apricot: Submodular selection for data summarization in Python","date":"2019-06-08","arxiv_id":"1906.03543","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/apricot-submodular-selection-for-data#ran","syntology_url":"https://syntology.ai/paper/1906.03543","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.03543"}},"official":{"repos":["jmschrei/apricot"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/fair-k-center-clustering-for-data","slug":"fair-k-center-clustering-for-data","title":"Fair k-Center Clustering for Data Summarization","date":"2019-01-24","arxiv_id":"1901.08628","repositories_listed":1,"syntology":null},{"url":"/paper/controlled-random-search-improves-hyper","slug":"controlled-random-search-improves-hyper","title":"Coverage-Based Designs Improve Sample Mining and Hyper-Parameter Optimization","date":"2018-09-05","arxiv_id":"1809.01712","repositories_listed":1,"syntology":null},{"url":"/paper/a-mixed-hierarchical-attention-based-encoder","slug":"a-mixed-hierarchical-attention-based-encoder","title":"A Mixed Hierarchical Attention based Encoder-Decoder Approach for Standard Table Summarization","date":"2018-04-20","arxiv_id":"1804.07790","repositories_listed":1,"syntology":null},{"url":"/paper/fair-and-diverse-dpp-based-data-summarization","slug":"fair-and-diverse-dpp-based-data-summarization","title":"Fair and Diverse DPP-based Data Summarization","date":"2018-02-12","arxiv_id":"1802.04023","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/fair-and-diverse-dpp-based-data-summarization#ran","syntology_url":"https://syntology.ai/paper/1802.04023","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.04023"}},"official":null}},{"url":"/paper/an-online-algorithm-for-nonparametric","slug":"an-online-algorithm-for-nonparametric","title":"An Online Algorithm for Nonparametric Correlations","date":"2017-12-05","arxiv_id":"1712.01521","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-k-means-clustering-via-lightweight","slug":"scalable-k-means-clustering-via-lightweight","title":"Scalable k-Means Clustering via Lightweight Coresets","date":"2017-02-27","arxiv_id":"1702.08248","repositories_listed":1,"syntology":null},{"url":"/paper/sequential-quantiles-via-hermite-series","slug":"sequential-quantiles-via-hermite-series","title":"Sequential Quantiles via Hermite Series Density Estimation","date":"2015-07-17","arxiv_id":"1507.05073","repositories_listed":1,"syntology":null},{"url":null,"slug":"pca-guided-quantile-sampling-preserving-data","title":"PCA-Guided Quantile Sampling: Preserving Data Structure in Large-Scale Subsampling","date":"2025-06-23","arxiv_id":"2506.18249","repositories_listed":0,"syntology":null},{"url":null,"slug":"ai-agents-vs-agentic-ai-a-conceptual-taxonomy","title":"AI Agents vs. Agentic AI: A Conceptual Taxonomy, Applications and Challenges","date":"2025-05-15","arxiv_id":"2505.10468","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-data-summarization-for-hierarchical","title":"Dynamic data summarization for hierarchical spatial clustering","date":"2024-11-26","arxiv_id":"2412.07789","repositories_listed":0,"syntology":null},{"url":null,"slug":"fair-clustering-for-data-summarization","title":"Fair Clustering for Data Summarization: Improved Approximation Algorithms and Complexity Insights","date":"2024-10-16","arxiv_id":"2410.12913","repositories_listed":0,"syntology":null},{"url":null,"slug":"linear-submodular-maximization-with-bandit","title":"Linear Submodular Maximization with Bandit Feedback","date":"2024-07-02","arxiv_id":"2407.02601","repositories_listed":0,"syntology":null},{"url":null,"slug":"gist-greedy-independent-set-thresholding-for","title":"GIST: Greedy Independent Set Thresholding for Diverse Data Summarization","date":"2024-05-29","arxiv_id":"2405.18754","repositories_listed":0,"syntology":null},{"url":null,"slug":"federated-combinatorial-multi-agent-multi","title":"Federated Combinatorial Multi-Agent Multi-Armed Bandits","date":"2024-05-09","arxiv_id":"2405.05950","repositories_listed":0,"syntology":null},{"url":null,"slug":"llmsense-harnessing-llms-for-high-level","title":"LLMSense: Harnessing LLMs for High-level Reasoning Over Spatiotemporal Sensor Traces","date":"2024-03-28","arxiv_id":"2403.19857","repositories_listed":0,"syntology":null},{"url":null,"slug":"greedyml-a-parallel-algorithm-for-maximizing","title":"GreedyML: A Parallel Algorithm for Maximizing Constrained Submodular Functions","date":"2024-03-15","arxiv_id":"2403.10332","repositories_listed":0,"syntology":null},{"url":null,"slug":"analysis-of-persian-news-agencies-on","title":"Analysis of Persian News Agencies on Instagram, A Words Co-occurrence Graph-based Approach","date":"2024-02-19","arxiv_id":"2402.12272","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-non-monotone-submodular-maximization","title":"Dynamic Non-monotone Submodular Maximization","date":"2023-11-07","arxiv_id":"2311.03685","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-spatio-temporal-summarization-using","title":"Dynamic Spatio-Temporal Summarization using Information Based Fusion","date":"2023-10-02","arxiv_id":"2310.01617","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-approximation-algorithms-for-non","title":"Robust Approximation Algorithms for Non-monotone $k$-Submodular Maximization under a Knapsack Constraint","date":"2023-09-21","arxiv_id":"2309.12025","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-summarization-beyond-monotonicity-non","title":"Data Summarization beyond Monotonicity: Non-monotone Two-Stage Submodular Maximization","date":"2023-09-11","arxiv_id":"2309.05183","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-usefulness-of-synthetic-tabular-data","title":"On the Usefulness of Synthetic Tabular Data Generation","date":"2023-06-27","arxiv_id":"2306.15636","repositories_listed":0,"syntology":null},{"url":null,"slug":"achieving-long-term-fairness-in-submodular","title":"Achieving Long-term Fairness in Submodular Maximization through Randomization","date":"2023-04-10","arxiv_id":"2304.04700","repositories_listed":0,"syntology":null},{"url":null,"slug":"group-fairness-in-non-monotone-submodular","title":"Group Fairness in Non-monotone Submodular Maximization","date":"2023-02-03","arxiv_id":"2302.01546","repositories_listed":0,"syntology":null},{"url":null,"slug":"max-min-diversification-with-fairness","title":"Max-Min Diversification with Fairness Constraints: Exact and Approximation Algorithms","date":"2023-01-05","arxiv_id":"2301.02053","repositories_listed":0,"syntology":null},{"url":null,"slug":"guided-exploration-of-data-summaries","title":"Guided Exploration of Data Summaries","date":"2022-05-27","arxiv_id":"2205.13956","repositories_listed":0,"syntology":null},{"url":null,"slug":"operations-for-autonomous-spacecraft","title":"Operations for Autonomous Spacecraft","date":"2021-11-22","arxiv_id":"2111.10970","repositories_listed":0,"syntology":null},{"url":null,"slug":"nnk-means-dictionary-learning-using-non","title":"NNK-Means: Data summarization using dictionary learning with non-negative kernel regression","date":"2021-10-15","arxiv_id":"2110.08212","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-general-robustness-to-bad-training","title":"Towards General Robustness to Bad Training Data","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"data-summarization-via-bilevel-optimization","title":"Data Summarization via Bilevel Optimization","date":"2021-09-26","arxiv_id":"2109.12534","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-unified-framework-for-task-driven-data","title":"A Unified Framework for Task-Driven Data Quality Management","date":"2021-06-10","arxiv_id":"2106.05484","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-sampling-for-fast-constrained","title":"Adaptive Sampling for Fast Constrained Maximization of Submodular Function","date":"2021-02-12","arxiv_id":"2102.06486","repositories_listed":0,"syntology":null},{"url":null,"slug":"introduction-to-core-sets-an-updated-survey","title":"Introduction to Core-sets: an Updated Survey","date":"2020-11-18","arxiv_id":"2011.09384","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-submodular-networks-for-extractive-data","title":"Deep Submodular Networks for Extractive Data Summarization","date":"2020-10-16","arxiv_id":"2010.08593","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-principled-approach-to-data-valuation-for","title":"A Principled Approach to Data Valuation for Federated Learning","date":"2020-09-14","arxiv_id":"2009.06192","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-and-private-submodular-and-k-submodular","title":"Fast and Private Submodular and $k$-Submodular Functions Maximization with Matroid Constraints","date":"2020-06-28","arxiv_id":"2006.15744","repositories_listed":0,"syntology":null},{"url":null,"slug":"non-adaptive-adaptive-sampling-on-turnstile","title":"Non-Adaptive Adaptive Sampling on Turnstile Streams","date":"2020-04-23","arxiv_id":"2004.10969","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-to-solve-fair-k-center-in-massive-data","title":"How to Solve Fair $k$-Center in Massive Data Models","date":"2020-02-18","arxiv_id":"2002.07682","repositories_listed":0,"syntology":null},{"url":null,"slug":"regularized-submodular-maximization-at-scale","title":"Regularized Submodular Maximization at Scale","date":"2020-02-10","arxiv_id":"2002.03503","repositories_listed":0,"syntology":null},{"url":null,"slug":"fair-k-centers-via-maximum-matching","title":"Fair k-Centers via Maximum Matching","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"how-to-solve-fair-k-center-in-massive-data-1","title":"How to Solve Fair k-Center in Massive Data Models","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"streaming-submodular-maximization-under-a-k-1","title":"Streaming Submodular Maximization under a k-Set System Constraint","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"differentially-private-distributed-data","title":"Differentially Private Distributed Data Summarization under Covariate Shift","date":"2019-10-28","arxiv_id":"1910.12832","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-empirical-and-comparative-analysis-of-data","title":"An Empirical and Comparative Analysis of Data Valuation with Scalable Algorithms","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"submodular-streaming-in-all-its-glory-tight","title":"Submodular Streaming in All its Glory: Tight Approximation, Minimum Memory and Low Adaptive Complexity","date":"2019-05-02","arxiv_id":"1905.00948","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-maximization-of-submodular-plus","title":"Distributed Maximization of Submodular plus Diversity Functions for Multi-label Feature Selection on Huge Datasets","date":"2019-03-20","arxiv_id":"1903.08351","repositories_listed":0,"syntology":null},{"url":null,"slug":"real-time-eeg-classification-via-coresets-for","title":"Real-Time EEG Classification via Coresets for BCI Applications","date":"2019-01-02","arxiv_id":"1901.00512","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-determinantal-point-processes-via","title":"Fast determinantal point processes via distortion-free intermediate sampling","date":"2018-11-08","arxiv_id":"1811.03717","repositories_listed":0,"syntology":null},{"url":null,"slug":"interpreting-black-box-predictions-using","title":"Interpreting Black Box Predictions using Fisher Kernels","date":"2018-10-23","arxiv_id":"1810.10118","repositories_listed":0,"syntology":null},{"url":null,"slug":"network-modeling-and-pathway-inference-from","title":"Network Modeling and Pathway Inference from Incomplete Data (\"PathInf\")","date":"2018-10-01","arxiv_id":"1810.00839","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-deletion-robust-submodular","title":"Scalable Deletion-Robust Submodular Maximization: Data Summarization with Privacy and Fairness Constraints","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"data-summarization-at-scale-a-two-stage","title":"Data Summarization at Scale: A Two-Stage Submodular Approach","date":"2018-06-07","arxiv_id":"1806.02815","repositories_listed":0,"syntology":null},{"url":null,"slug":"differentiable-submodular-maximization","title":"Differentiable Submodular Maximization","date":"2018-03-05","arxiv_id":"1803.01785","repositories_listed":0,"syntology":null},{"url":null,"slug":"interactive-submodular-bandit","title":"Interactive Submodular Bandit","date":"2017-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"one-shot-coresets-the-case-of-k-clustering","title":"One-Shot Coresets: The Case of k-Clustering","date":"2017-11-27","arxiv_id":"1711.09649","repositories_listed":0,"syntology":null},{"url":null,"slug":"streaming-robust-submodular-maximization-a","title":"Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach","date":"2017-11-07","arxiv_id":"1711.02598","repositories_listed":0,"syntology":null},{"url":null,"slug":"deletion-robust-submodular-maximization-data","title":"Deletion-Robust Submodular Maximization: Data Summarization with \"the Right to be Forgotten\"","date":"2017-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"differentially-private-submodular","title":"Differentially Private Submodular Maximization: Data Summarization in Disguise","date":"2017-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"subdeterminant-maximization-via-nonconvex","title":"Subdeterminant Maximization via Nonconvex Relaxations and Anti-concentration","date":"2017-07-10","arxiv_id":"1707.02757","repositories_listed":0,"syntology":null},{"url":null,"slug":"coresets-for-vector-summarization-with","title":"Coresets for Vector Summarization with Applications to Network Graphs","date":"2017-06-17","arxiv_id":"1706.05554","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-submodular-maximization-a-non-uniform","title":"Robust Submodular Maximization: A Non-Uniform Partitioning Approach","date":"2017-06-15","arxiv_id":"1706.04918","repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-sparsity-for-efficient-submodular","title":"Leveraging Sparsity for Efficient Submodular Data Summarization","date":"2017-03-08","arxiv_id":"1703.02690","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-summarization-methods-and-applications","title":"Graph Summarization Methods and Applications: A Survey","date":"2016-12-14","arxiv_id":"1612.04883","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-distributed-submodular-cover-public","title":"Fast Distributed Submodular Cover: Public-Private Data Summarization","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"linear-relaxations-for-finding-diverse","title":"Linear Relaxations for Finding Diverse Elements in Metric Spaces","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"less-is-more-learning-prominent-and-diverse","title":"Less is More: Learning Prominent and Diverse Topics for Data Summarization","date":"2016-11-29","arxiv_id":"1611.09921","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-to-be-fair-and-diverse","title":"How to be Fair and Diverse?","date":"2016-10-23","arxiv_id":"1610.07183","repositories_listed":0,"syntology":null},{"url":null,"slug":"guaranteed-non-convex-optimization-submodular","title":"Guaranteed Non-convex Optimization: Submodular Maximization over Continuous Domains","date":"2016-06-17","arxiv_id":"1606.05615","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-submodular-cover-succinctly","title":"Distributed Submodular Cover: Succinctly Summarizing Massive Data","date":"2015-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"lazier-than-lazy-greedy","title":"Lazier Than Lazy Greedy","date":"2014-09-28","arxiv_id":"1409.7938","repositories_listed":0,"syntology":null}],"syntology_records":9,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":8,"papers_where_code_ran_first_page":"/task/data-summarization/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/task/data-summarization/papers/ran/1","json":"/task/data-summarization/papers/ran/1.json","rows":8}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"5163a6b50ca11ce9481e6db772699f40173576956c775b01a2b32566db5384ad","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}