{"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/dimensionality-reduction","name":"Dimensionality Reduction","slug":"dimensionality-reduction","description_markdown":"Dimensionality reduction is the task of reducing the dimensionality of a dataset.\r\n\r\n<span style=\"color:grey; opacity: 0.6\">( Image credit: [openTSNE](https://github.com/pavlin-policar/openTSNE) )</span>","categories":[{"name":"Computer Vision","url":"/area/computer-vision"},{"name":"Methodology","url":"/area/methodology"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":3304,"papers_with_code":857,"benchmarks":2,"benchmark_tables_in_archive":2,"benchmark_tables_shown":2,"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":11,"subtasks":2,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/dimensionality-reduction-on-mca","slug":"dimensionality-reduction-on-mca","dataset":"MCA","dataset_url":null,"rows_in_archive":4,"metrics":["Classification Accuracy"],"first_row_in_archive_order":{"model":"UDRN","paper_title":"UDRN: Unified Dimensional Reduction Neural Network for Feature Selection and Feature Projection","paper_url":"/paper/udrn-unified-dimensional-reduction-neural","paper_date":"2022-07-08","arxiv_id":"2207.03809","code_links":[],"syntology":null}},{"leaderboard":"/sota/dimensionality-reduction-on-emnist","slug":"dimensionality-reduction-on-emnist","dataset":"EMNIST","dataset_url":"/dataset/emnist","rows_in_archive":2,"metrics":["Classification Accuracy"],"first_row_in_archive_order":{"model":"UDRN","paper_title":"UDRN: Unified Dimensional Reduction Neural Network for Feature Selection and Feature Projection","paper_url":"/paper/udrn-unified-dimensional-reduction-neural","paper_date":"2022-07-08","arxiv_id":"2207.03809","code_links":[],"syntology":null}}],"datasets":[{"url":"/dataset/emnist","name":"EMNIST","full_name":"Extended MNIST","num_papers_in_archive":264},{"url":"/dataset/cn-celeb","name":"CN-CELEB","full_name":"","num_papers_in_archive":68},{"url":"/dataset/oxford105k","name":"Oxford105k","full_name":"","num_papers_in_archive":44},{"url":"/dataset/string","name":"STRING","full_name":"STRING","num_papers_in_archive":35},{"url":"/dataset/holstep","name":"HolStep","full_name":"","num_papers_in_archive":10},{"url":"/dataset/oxford-affine","name":"Oxford-Affine","full_name":"","num_papers_in_archive":7},{"url":"/dataset/atariari","name":"AtariARI","full_name":"Atari Annotated RAM Interface","num_papers_in_archive":6},{"url":"/dataset/goodsounds","name":"GoodSounds","full_name":null,"num_papers_in_archive":4},{"url":"/dataset/deep-fakes-dataset","name":"Deep Fakes Dataset","full_name":"inamibora","num_papers_in_archive":3},{"url":"/dataset/sof","name":"SoF","full_name":"Specs on Faces","num_papers_in_archive":3},{"url":"/dataset/algad","name":"ALGAD","full_name":"Andy Lomas Generative Art Dataset","num_papers_in_archive":2}],"subtasks":[{"url":"/task/online-nonnegative-cp-decomposition","name":"Online nonnegative CP decomposition"},{"url":"/task/supervised-dimensionality-reduction","name":"Supervised dimensionality reduction"}],"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":34,"rows_per_page":100,"shown":100,"of":3304,"of_with_code":857,"tagged_in_all":3304,"counts":{"archive_papers_tagged":3304,"with_a_code_link":857,"where_syntology_ran_a_sample":100,"not_listed_spam_title":0,"listed":3304,"listed_where_code_ran":100,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":84,"every_run_a_failure_of_syntologys_instrument":16,"listed_with_a_run_with_no_instrument_failure":84,"listed_every_run_a_failure_of_syntologys_instrument":16,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/umap-uniform-manifold-approximation-and","slug":"umap-uniform-manifold-approximation-and","title":"UMAP: Uniform Manifold Approximation and Projection for Dimension Reduction","date":"2018-02-09","arxiv_id":"1802.03426","repositories_listed":39,"syntology":null},{"url":"/paper/adversarial-autoencoders","slug":"adversarial-autoencoders","title":"Adversarial Autoencoders","date":"2015-11-18","arxiv_id":"1511.05644","repositories_listed":29,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":5,"n_instrument":4,"n_unverified":3,"n_honours":3,"n_violates":1,"n_no_contract":1,"n_pointer_only":9,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 3 honoured, 1 violated, 1 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/adversarial-autoencoders#ran","syntology_url":"https://syntology.ai/paper/1511.05644","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.05644"}},"official":null}},{"url":"/paper/xgboost-a-scalable-tree-boosting-system","slug":"xgboost-a-scalable-tree-boosting-system","title":"XGBoost: A Scalable Tree Boosting System","date":"2016-03-09","arxiv_id":"1603.02754","repositories_listed":28,"syntology":{"n":17,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":10,"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) · 10 unverified","sample_list":"/paper/xgboost-a-scalable-tree-boosting-system#ran","syntology_url":"https://syntology.ai/paper/1603.02754","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.02754"}},"official":{"repos":["dmlc/xgboost"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/eca-net-efficient-channel-attention-for-deep","slug":"eca-net-efficient-channel-attention-for-deep","title":"ECA-Net: Efficient Channel Attention for Deep Convolutional Neural Networks","date":"2019-10-08","arxiv_id":"1910.03151","repositories_listed":13,"syntology":{"n":8,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 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; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/eca-net-efficient-channel-attention-for-deep#ran","syntology_url":"https://syntology.ai/paper/1910.03151","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.03151"}},"official":{"repos":["BangguWu/ECANet"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/rethinking-spatial-dimensions-of-vision","slug":"rethinking-spatial-dimensions-of-vision","title":"Rethinking Spatial Dimensions of Vision Transformers","date":"2021-03-30","arxiv_id":"2103.16302","repositories_listed":12,"syntology":{"n":20,"n_ran":10,"n_constructed":6,"n_ran_checked":10,"n_instrument":0,"n_unverified":10,"n_honours":2,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"10 ran (of which 6 constructed an object rather than computing a result; 10 with no instrument failure: 2 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/rethinking-spatial-dimensions-of-vision#ran","syntology_url":"https://syntology.ai/paper/2103.16302","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.16302"}},"official":{"repos":["naver-ai/pit"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["listed"]}}},{"url":"/paper/towards-k-means-friendly-spaces-simultaneous","slug":"towards-k-means-friendly-spaces-simultaneous","title":"Towards K-means-friendly Spaces: Simultaneous Deep Learning and Clustering","date":"2016-10-15","arxiv_id":"1610.04794","repositories_listed":11,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-k-means-friendly-spaces-simultaneous#ran","syntology_url":"https://syntology.ai/paper/1610.04794","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1610.04794"}},"official":{"repos":["boyangumn/DCN"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/catboost-unbiased-boosting-with-categorical","slug":"catboost-unbiased-boosting-with-categorical","title":"CatBoost: unbiased boosting with categorical features","date":"2017-06-28","arxiv_id":"1706.09516","repositories_listed":10,"syntology":null},{"url":"/paper/efficient-algorithms-for-t-distributed","slug":"efficient-algorithms-for-t-distributed","title":"Efficient Algorithms for t-distributed Stochastic Neighborhood Embedding","date":"2017-12-25","arxiv_id":"1712.09005","repositories_listed":8,"syntology":{"n":6,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 6 unverified","sample_list":"/paper/efficient-algorithms-for-t-distributed#ran","syntology_url":"https://syntology.ai/paper/1712.09005","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1712.09005"}},"official":null}},{"url":"/paper/som-vae-interpretable-discrete-representation","slug":"som-vae-interpretable-discrete-representation","title":"SOM-VAE: Interpretable Discrete Representation Learning on Time Series","date":"2018-06-06","arxiv_id":"1806.02199","repositories_listed":6,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/som-vae-interpretable-discrete-representation#ran","syntology_url":"https://syntology.ai/paper/1806.02199","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.02199"}},"official":{"repos":["ratschlab/SOM-VAE"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/unifying-deep-local-and-global-features-for","slug":"unifying-deep-local-and-global-features-for","title":"Unifying Deep Local and Global Features for Image Search","date":"2020-01-14","arxiv_id":"2001.05027","repositories_listed":5,"syntology":null},{"url":"/paper/unsupervised-speech-representation-learning","slug":"unsupervised-speech-representation-learning","title":"Unsupervised speech representation learning using WaveNet autoencoders","date":"2019-01-25","arxiv_id":"1901.08810","repositories_listed":5,"syntology":null},{"url":"/paper/zoo-zeroth-order-optimization-based-black-box","slug":"zoo-zeroth-order-optimization-based-black-box","title":"ZOO: Zeroth Order Optimization based Black-box Attacks to Deep Neural Networks without Training Substitute Models","date":"2017-08-14","arxiv_id":"1708.03999","repositories_listed":5,"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/zoo-zeroth-order-optimization-based-black-box#ran","syntology_url":"https://syntology.ai/paper/1708.03999","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1708.03999"}},"official":{"repos":["huanzhang12/ZOO-Attack"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/diagnosing-and-fixing-manifold-overfitting-in","slug":"diagnosing-and-fixing-manifold-overfitting-in","title":"Diagnosing and Fixing Manifold Overfitting in Deep Generative Models","date":"2022-04-14","arxiv_id":"2204.07172","repositories_listed":4,"syntology":null},{"url":"/paper/computing-the-full-signature-kernel-as-the","slug":"computing-the-full-signature-kernel-as-the","title":"The Signature Kernel is the solution of a Goursat PDE","date":"2020-06-26","arxiv_id":"2006.14794","repositories_listed":4,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/computing-the-full-signature-kernel-as-the#ran","syntology_url":"https://syntology.ai/paper/2006.14794","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.14794"}},"official":{"repos":["crispitagorico/SignatureKernel","crispitagorico/sigkernel"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/multivariate-time-series-imputation-with-1","slug":"multivariate-time-series-imputation-with-1","title":"GP-VAE: Deep Probabilistic Time Series Imputation","date":"2019-07-09","arxiv_id":"1907.04155","repositories_listed":4,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/multivariate-time-series-imputation-with-1#ran","syntology_url":"https://syntology.ai/paper/1907.04155","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.04155"}},"official":{"repos":["ratschlab/GP-VAE"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/using-text-embeddings-for-causal-inference","slug":"using-text-embeddings-for-causal-inference","title":"Adapting Text Embeddings for Causal Inference","date":"2019-05-29","arxiv_id":"1905.12741","repositories_listed":4,"syntology":null},{"url":"/paper/deep-temporal-clustering-fully-unsupervised","slug":"deep-temporal-clustering-fully-unsupervised","title":"Deep Temporal Clustering : Fully Unsupervised Learning of Time-Domain Features","date":"2018-02-04","arxiv_id":"1802.01059","repositories_listed":4,"syntology":null},{"url":"/paper/tensorflow-large-scale-machine-learning-on","slug":"tensorflow-large-scale-machine-learning-on","title":"TensorFlow: Large-Scale Machine Learning on Heterogeneous Distributed Systems","date":"2016-03-14","arxiv_id":"1603.04467","repositories_listed":4,"syntology":null},{"url":"/paper/a-primer-on-the-signature-method-in-machine","slug":"a-primer-on-the-signature-method-in-machine","title":"A Primer on the Signature Method in Machine Learning","date":"2016-03-11","arxiv_id":"1603.03788","repositories_listed":4,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"4 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; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/a-primer-on-the-signature-method-in-machine#ran","syntology_url":"https://syntology.ai/paper/1603.03788","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.03788"}},"official":{"repos":["patrick-kidger/signatory"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/film-frequency-improved-legendre-memory-model","slug":"film-frequency-improved-legendre-memory-model","title":"FiLM: Frequency improved Legendre Memory Model for Long-term Time Series Forecasting","date":"2022-05-18","arxiv_id":"2205.08897","repositories_listed":3,"syntology":{"n":18,"n_ran":17,"n_constructed":2,"n_ran_checked":5,"n_instrument":12,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":4,"n_pointer_only":2,"phrase":"17 ran (of which 2 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 1 violated, 4 with no contract checked; 12 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/film-frequency-improved-legendre-memory-model#ran","syntology_url":"https://syntology.ai/paper/2205.08897","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.08897"}},"official":{"repos":["WenjieDu/PyPOTS"],"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":["listed","named_in_paper"]}}},{"url":"/paper/wassmap-wasserstein-isometric-mapping-for","slug":"wassmap-wasserstein-isometric-mapping-for","title":"Wassmap: Wasserstein Isometric Mapping for Image Manifold Learning","date":"2022-04-13","arxiv_id":"2204.06645","repositories_listed":3,"syntology":null},{"url":"/paper/m-ar-k-fast-independent-component-analysis","slug":"m-ar-k-fast-independent-component-analysis","title":"M-ar-K-Fast Independent Component Analysis","date":"2021-08-17","arxiv_id":"2108.07908","repositories_listed":3,"syntology":null},{"url":"/paper/improving-the-hardnet-descriptor","slug":"improving-the-hardnet-descriptor","title":"Improving the HardNet Descriptor","date":"2020-07-19","arxiv_id":"2007.09699","repositories_listed":3,"syntology":null},{"url":"/paper/extracting-the-main-trend-in-a-dataset-the","slug":"extracting-the-main-trend-in-a-dataset-the","title":"Extracting the main trend in a dataset: the Sequencer algorithm","date":"2020-06-24","arxiv_id":"2006.13948","repositories_listed":3,"syntology":null},{"url":"/paper/semantic-relatedness-based-re-ranker-for-text","slug":"semantic-relatedness-based-re-ranker-for-text","title":"Semantic Relatedness Based Re-ranker for Text Spotting","date":"2019-09-17","arxiv_id":"1909.07950","repositories_listed":3,"syntology":null},{"url":"/paper/catch22-canonical-time-series-characteristics","slug":"catch22-canonical-time-series-characteristics","title":"catch22: CAnonical Time-series CHaracteristics","date":"2019-01-29","arxiv_id":"1901.10200","repositories_listed":3,"syntology":null},{"url":"/paper/catboost-gradient-boosting-with-categorical","slug":"catboost-gradient-boosting-with-categorical","title":"CatBoost: gradient boosting with categorical features support","date":"2018-10-24","arxiv_id":"1810.11363","repositories_listed":3,"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/catboost-gradient-boosting-with-categorical#ran","syntology_url":"https://syntology.ai/paper/1810.11363","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.11363"}},"official":{"repos":["catboost/catboost"],"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/unsupervised-metric-learning-in-presence-of","slug":"unsupervised-metric-learning-in-presence-of","title":"Unsupervised Metric Learning in Presence of Missing Data","date":"2018-07-19","arxiv_id":"1807.07610","repositories_listed":3,"syntology":null},{"url":"/paper/reservoir-computing-approaches-for","slug":"reservoir-computing-approaches-for","title":"Reservoir computing approaches for representation and classification of multivariate time series","date":"2018-03-21","arxiv_id":"1803.07870","repositories_listed":3,"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":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/reservoir-computing-approaches-for#ran","syntology_url":"https://syntology.ai/paper/1803.07870","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.07870"}},"official":{"repos":["FilippoMB/Reservoir-Computing-framework-for-multivariate-time-series-classification","FilippoMB/Reservoir-model-space-classifier"],"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/deep-continuous-clustering","slug":"deep-continuous-clustering","title":"Deep Continuous Clustering","date":"2018-03-05","arxiv_id":"1803.01449","repositories_listed":3,"syntology":null},{"url":"/paper/efficient-manifold-and-subspace","slug":"efficient-manifold-and-subspace","title":"Efficient Manifold and Subspace Approximations with Spherelets","date":"2017-06-26","arxiv_id":"1706.08263","repositories_listed":3,"syntology":null},{"url":"/paper/tensor-canonical-correlation-analysis-for","slug":"tensor-canonical-correlation-analysis-for","title":"Tensor Canonical Correlation Analysis for Multi-view Dimension Reduction","date":"2015-02-09","arxiv_id":"1502.02330","repositories_listed":3,"syntology":null},{"url":"/paper/scikit-learn-machine-learning-in-python","slug":"scikit-learn-machine-learning-in-python","title":"Scikit-learn: Machine Learning in Python","date":"2012-01-02","arxiv_id":"1201.0490","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"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: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/scikit-learn-machine-learning-in-python#ran","syntology_url":"https://syntology.ai/paper/1201.0490","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1201.0490"}},"official":null}},{"url":"/paper/stochastic-gradient-descent-estimation-of","slug":"stochastic-gradient-descent-estimation-of","title":"Stochastic gradient descent estimation of generalized matrix factorization models with application to single-cell RNA sequencing data","date":"2024-12-29","arxiv_id":"2412.20509","repositories_listed":2,"syntology":null},{"url":"/paper/dimension-reduction-with-locally-adjusted","slug":"dimension-reduction-with-locally-adjusted","title":"Dimension Reduction with Locally Adjusted Graphs","date":"2024-12-19","arxiv_id":"2412.15426","repositories_listed":2,"syntology":null},{"url":"/paper/quack-quantum-aligned-centroid-kernel","slug":"quack-quantum-aligned-centroid-kernel","title":"QUACK: Quantum Aligned Centroid Kernel","date":"2024-05-01","arxiv_id":"2405.00304","repositories_listed":2,"syntology":null},{"url":"/paper/discover-and-mitigate-multiple-biased","slug":"discover-and-mitigate-multiple-biased","title":"Discover and Mitigate Multiple Biased Subgroups in Image Classifiers","date":"2024-03-19","arxiv_id":"2403.12777","repositories_listed":2,"syntology":null},{"url":"/paper/light-curve-classification-with-distclassipy","slug":"light-curve-classification-with-distclassipy","title":"Light Curve Classification with DistClassiPy: a new distance-based classifier","date":"2024-03-18","arxiv_id":"2403.12120","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/light-curve-classification-with-distclassipy#ran","syntology_url":"https://syntology.ai/paper/2403.12120","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.12120"}},"official":{"repos":["sidchaini/distclassipy","sidchaini/lightcurvedistanceclassification"],"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/filp-3d-enhancing-3d-few-shot-class","slug":"filp-3d-enhancing-3d-few-shot-class","title":"FILP-3D: Enhancing 3D Few-shot Class-incremental Learning with Pre-trained Vision-Language Models","date":"2023-12-28","arxiv_id":"2312.17051","repositories_listed":2,"syntology":null},{"url":"/paper/leanvec-search-your-vectors-faster-by-making","slug":"leanvec-search-your-vectors-faster-by-making","title":"LeanVec: Searching vectors faster by making them fit","date":"2023-12-26","arxiv_id":"2312.16335","repositories_listed":2,"syntology":null},{"url":"/paper/metric-space-magnitude-for-evaluating","slug":"metric-space-magnitude-for-evaluating","title":"Metric Space Magnitude for Evaluating the Diversity of Latent Representations","date":"2023-11-27","arxiv_id":"2311.16054","repositories_listed":2,"syntology":{"n":33,"n_ran":30,"n_constructed":0,"n_ran_checked":30,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":29,"n_pointer_only":10,"phrase":"30 ran (of which 0 constructed an object rather than computing a result; 30 with no instrument failure: 0 honoured, 1 violated, 29 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/metric-space-magnitude-for-evaluating#ran","syntology_url":"https://syntology.ai/paper/2311.16054","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.16054"}},"official":{"repos":["aidos-lab/magnitude-diversity","aidos-lab/magnipy"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":0,"n_ran_no_instrument_failure":17,"n_unverified":3,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/o-k-equivariant-dimensionality-reduction-on","slug":"o-k-equivariant-dimensionality-reduction-on","title":"$O(k)$-Equivariant Dimensionality Reduction on Stiefel Manifolds","date":"2023-09-19","arxiv_id":"2309.10775","repositories_listed":2,"syntology":null},{"url":"/paper/jl-lemma-derived-optimal-projections-for","slug":"jl-lemma-derived-optimal-projections-for","title":"Optimal Projections for Discriminative Dictionary Learning using the JL-lemma","date":"2023-08-27","arxiv_id":"2308.13991","repositories_listed":2,"syntology":null},{"url":"/paper/learning-active-subspaces-and-discovering","slug":"learning-active-subspaces-and-discovering","title":"Learning Active Subspaces and Discovering Important Features with Gaussian Radial Basis Functions Neural Networks","date":"2023-07-11","arxiv_id":"2307.05639","repositories_listed":2,"syntology":null},{"url":"/paper/the-rank-reduced-kalman-filter-approximate-1","slug":"the-rank-reduced-kalman-filter-approximate-1","title":"The Rank-Reduced Kalman Filter: Approximate Dynamical-Low-Rank Filtering In High Dimensions","date":"2023-06-13","arxiv_id":"2306.07774","repositories_listed":2,"syntology":null},{"url":"/paper/collection-space-navigator-an-interactive","slug":"collection-space-navigator-an-interactive","title":"Collection Space Navigator: An Interactive Visualization Interface for Multidimensional Datasets","date":"2023-05-11","arxiv_id":"2305.06809","repositories_listed":2,"syntology":null},{"url":"/paper/ellipsoid-fitting-with-the-cayley-transform","slug":"ellipsoid-fitting-with-the-cayley-transform","title":"Ellipsoid fitting with the Cayley transform","date":"2023-04-20","arxiv_id":"2304.10630","repositories_listed":2,"syntology":null},{"url":"/paper/learning-3d-human-pose-estimation-from-dozens","slug":"learning-3d-human-pose-estimation-from-dozens","title":"Learning 3D Human Pose Estimation from Dozens of Datasets using a Geometry-Aware Autoencoder to Bridge Between Skeleton Formats","date":"2022-12-29","arxiv_id":"2212.14474","repositories_listed":2,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 1 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/learning-3d-human-pose-estimation-from-dozens#ran","syntology_url":"https://syntology.ai/paper/2212.14474","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.14474"}},"official":null}},{"url":"/paper/minimalist-data-wrangling-with-python","slug":"minimalist-data-wrangling-with-python","title":"Minimalist Data Wrangling with Python","date":"2022-11-09","arxiv_id":"2211.04630","repositories_listed":2,"syntology":null},{"url":"/paper/paradime-a-framework-for-parametric","slug":"paradime-a-framework-for-parametric","title":"ParaDime: A Framework for Parametric Dimensionality Reduction","date":"2022-10-10","arxiv_id":"2210.04582","repositories_listed":2,"syntology":null},{"url":"/paper/risk-of-bias-in-chest-x-ray-foundation-models","slug":"risk-of-bias-in-chest-x-ray-foundation-models","title":"Risk of Bias in Chest Radiography Deep Learning Foundation Models","date":"2022-09-07","arxiv_id":"2209.02965","repositories_listed":2,"syntology":null},{"url":"/paper/evaluating-systemic-error-detection-methods","slug":"evaluating-systemic-error-detection-methods","title":"Towards a More Rigorous Science of Blindspot Discovery in Image Classification Models","date":"2022-07-08","arxiv_id":"2207.04104","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/evaluating-systemic-error-detection-methods#ran","syntology_url":"https://syntology.ai/paper/2207.04104","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.04104"}},"official":{"repos":["njohnson99/spotcheck"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/derivate-informed-neural-operator-an","slug":"derivate-informed-neural-operator-an","title":"Derivative-Informed Neural Operator: An Efficient Framework for High-Dimensional Parametric Derivative Learning","date":"2022-06-21","arxiv_id":"2206.10745","repositories_listed":2,"syntology":null},{"url":"/paper/ccp-correlated-clustering-and-projection-for","slug":"ccp-correlated-clustering-and-projection-for","title":"CCP: Correlated Clustering and Projection for Dimensionality Reduction","date":"2022-06-08","arxiv_id":"2206.04189","repositories_listed":2,"syntology":null},{"url":"/paper/neural-implicit-flow-a-mesh-agnostic","slug":"neural-implicit-flow-a-mesh-agnostic","title":"Neural Implicit Flow: a mesh-agnostic dimensionality reduction paradigm of spatio-temporal data","date":"2022-04-07","arxiv_id":"2204.03216","repositories_listed":2,"syntology":null},{"url":"/paper/tts-gan-a-transformer-based-time-series","slug":"tts-gan-a-transformer-based-time-series","title":"TTS-GAN: A Transformer-based Time-Series Generative Adversarial Network","date":"2022-02-06","arxiv_id":"2202.02691","repositories_listed":2,"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":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/tts-gan-a-transformer-based-time-series#ran","syntology_url":"https://syntology.ai/paper/2202.02691","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.02691"}},"official":{"repos":["imics-lab/tts-gan"],"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":["listed","official"]}}},{"url":"/paper/error-correcting-neural-networks-for-two","slug":"error-correcting-neural-networks-for-two","title":"Error-Correcting Neural Networks for Two-Dimensional Curvature Computation in the Level-Set Method","date":"2022-01-22","arxiv_id":"2201.12342","repositories_listed":2,"syntology":null},{"url":"/paper/level-set-learning-with-pseudo-reversible","slug":"level-set-learning-with-pseudo-reversible","title":"Level set learning with pseudo-reversible neural networks for nonlinear dimension reduction in function approximation","date":"2021-12-02","arxiv_id":"2112.01438","repositories_listed":2,"syntology":null},{"url":"/paper/dimensionality-reduction-of-longitudinal","slug":"dimensionality-reduction-of-longitudinal","title":"Dimensionality Reduction of Longitudinal 'Omics Data using Modern Tensor Factorization","date":"2021-11-28","arxiv_id":"2111.14159","repositories_listed":2,"syntology":null},{"url":"/paper/clustering-with-umap-why-and-how-connectivity","slug":"clustering-with-umap-why-and-how-connectivity","title":"Clustering with UMAP: Why and How Connectivity Matters","date":"2021-08-12","arxiv_id":"2108.05525","repositories_listed":2,"syntology":null},{"url":"/paper/manifold-learning-based-polynomial-chaos","slug":"manifold-learning-based-polynomial-chaos","title":"Manifold learning-based polynomial chaos expansions for high-dimensional surrogate models","date":"2021-07-21","arxiv_id":"2107.09814","repositories_listed":2,"syntology":null},{"url":"/paper/deep-learning-for-functional-data-analysis","slug":"deep-learning-for-functional-data-analysis","title":"Deep Learning for Functional Data Analysis with Adaptive Basis Layers","date":"2021-06-19","arxiv_id":"2106.10414","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/deep-learning-for-functional-data-analysis#ran","syntology_url":"https://syntology.ai/paper/2106.10414","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.10414"}},"official":{"repos":["jwyyy/AdaFNN"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/conditional-deep-inverse-rosenblatt","slug":"conditional-deep-inverse-rosenblatt","title":"Scalable conditional deep inverse Rosenblatt transports using tensor-trains and gradient-based dimension reduction","date":"2021-06-08","arxiv_id":"2106.04170","repositories_listed":2,"syntology":null},{"url":"/paper/distribution-agnostic-symbolic","slug":"distribution-agnostic-symbolic","title":"Distribution Agnostic Symbolic Representations for Time Series Dimensionality Reduction and Online Anomaly Detection","date":"2021-05-20","arxiv_id":"2105.09592","repositories_listed":2,"syntology":null},{"url":"/paper/datalens-scalable-privacy-preserving-training","slug":"datalens-scalable-privacy-preserving-training","title":"DataLens: Scalable Privacy Preserving Training via Gradient Compression and Aggregation","date":"2021-03-20","arxiv_id":"2103.11109","repositories_listed":2,"syntology":null},{"url":"/paper/latent-linear-dynamics-in-spatiotemporal","slug":"latent-linear-dynamics-in-spatiotemporal","title":"Unsupervised dynamic modeling of medical image transformation","date":"2021-03-01","arxiv_id":"2103.00930","repositories_listed":2,"syntology":null},{"url":"/paper/reduced-operator-inference-for-nonlinear","slug":"reduced-operator-inference-for-nonlinear","title":"Reduced operator inference for nonlinear partial differential equations","date":"2021-01-29","arxiv_id":"2102.00083","repositories_listed":2,"syntology":null},{"url":"/paper/hyperspectral-image-classification-artifacts","slug":"hyperspectral-image-classification-artifacts","title":"Hyperspectral Image Classification: Artifacts of Dimension Reduction on Hybrid CNN","date":"2021-01-25","arxiv_id":"2101.10532","repositories_listed":2,"syntology":null},{"url":"/paper/multi-view-data-visualisation-via-manifold","slug":"multi-view-data-visualisation-via-manifold","title":"Multi-view Data Visualisation via Manifold Learning","date":"2021-01-17","arxiv_id":"2101.06763","repositories_listed":2,"syntology":null},{"url":"/paper/probabilistic-contrastive-principal-component","slug":"probabilistic-contrastive-principal-component","title":"Probabilistic Contrastive Principal Component Analysis","date":"2020-12-14","arxiv_id":"2012.07977","repositories_listed":2,"syntology":null},{"url":"/paper/understanding-how-dimension-reduction-tools","slug":"understanding-how-dimension-reduction-tools","title":"Understanding How Dimension Reduction Tools Work: An Empirical Approach to Deciphering t-SNE, UMAP, TriMAP, and PaCMAP for Data Visualization","date":"2020-12-08","arxiv_id":"2012.04456","repositories_listed":2,"syntology":null},{"url":"/paper/q-sne-visualizing-data-using-q-gaussian","slug":"q-sne-visualizing-data-using-q-gaussian","title":"q-SNE: Visualizing Data using q-Gaussian Distributed Stochastic Neighbor Embedding","date":"2020-12-02","arxiv_id":"2012.00999","repositories_listed":2,"syntology":null},{"url":"/paper/quick-and-robust-feature-selection-the","slug":"quick-and-robust-feature-selection-the","title":"Quick and Robust Feature Selection: the Strength of Energy-efficient Sparse Training for Autoencoders","date":"2020-12-01","arxiv_id":"2012.00560","repositories_listed":2,"syntology":null},{"url":"/paper/parametric-umap-learning-embeddings-with-deep","slug":"parametric-umap-learning-embeddings-with-deep","title":"Parametric UMAP embeddings for representation and semi-supervised learning","date":"2020-09-27","arxiv_id":"2009.12981","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":2,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 2 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/parametric-umap-learning-embeddings-with-deep#ran","syntology_url":"https://syntology.ai/paper/2009.12981","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.12981"}},"official":{"repos":["lmcinnes/umap","timsainb/ParametricUMAP_paper"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-perturbation-based-out-of-sample-extension","slug":"a-perturbation-based-out-of-sample-extension","title":"A Perturbation-Based Kernel Approximation Framework","date":"2020-09-07","arxiv_id":"2009.02955","repositories_listed":2,"syntology":null},{"url":"/paper/a-fully-bayesian-gradient-free-supervised","slug":"a-fully-bayesian-gradient-free-supervised","title":"A Fully Bayesian Gradient-Free Supervised Dimension Reduction Method using Gaussian Processes","date":"2020-08-08","arxiv_id":"2008.03534","repositories_listed":2,"syntology":null},{"url":"/paper/contrastive-multiple-correspondence-analysis","slug":"contrastive-multiple-correspondence-analysis","title":"Contrastive Multiple Correspondence Analysis (cMCA): Using Contrastive Learning to Identify Latent Subgroups in Political Parties","date":"2020-07-09","arxiv_id":"2007.04540","repositories_listed":2,"syntology":null},{"url":"/paper/a-new-basis-for-sparse-pca","slug":"a-new-basis-for-sparse-pca","title":"A New Basis for Sparse Principal Component Analysis","date":"2020-07-01","arxiv_id":"2007.00596","repositories_listed":2,"syntology":null},{"url":"/paper/physics-aware-registration-based-auto-encoder","slug":"physics-aware-registration-based-auto-encoder","title":"Physics-aware registration based auto-encoder for convection dominated PDEs","date":"2020-06-28","arxiv_id":"2006.15655","repositories_listed":2,"syntology":null},{"url":"/paper/latent-variable-modeling-with-random-features","slug":"latent-variable-modeling-with-random-features","title":"Latent variable modeling with random features","date":"2020-06-19","arxiv_id":"2006.11145","repositories_listed":2,"syntology":null},{"url":"/paper/markov-lipschitz-deep-learning","slug":"markov-lipschitz-deep-learning","title":"Markov-Lipschitz Deep Learning","date":"2020-06-15","arxiv_id":"2006.08256","repositories_listed":2,"syntology":{"n":7,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/markov-lipschitz-deep-learning#ran","syntology_url":"https://syntology.ai/paper/2006.08256","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.08256"}},"official":{"repos":["westlake-cairi/Markov-Lipschitz-Deep-Learning"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/fast-network-embedding-enhancement-via-high","slug":"fast-network-embedding-enhancement-via-high","title":"Fast Network Embedding Enhancement via High Order Proximity Approximation","date":"2020-05-13","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/flows-for-simultaneous-manifold-learning-and","slug":"flows-for-simultaneous-manifold-learning-and","title":"Flows for simultaneous manifold learning and density estimation","date":"2020-03-31","arxiv_id":"2003.13913","repositories_listed":2,"syntology":null},{"url":"/paper/fully-convolutional-variational-autoencoder","slug":"fully-convolutional-variational-autoencoder","title":"Fully Convolutional Variational Autoencoder For Feature Extraction Of Fire Detection System","date":"2020-03-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/deep-learning-of-dynamical-attractors-from","slug":"deep-learning-of-dynamical-attractors-from","title":"Deep reconstruction of strange attractors from time series","date":"2020-02-14","arxiv_id":"2002.05909","repositories_listed":2,"syntology":null},{"url":"/paper/gaussian-process-latent-variable-model","slug":"gaussian-process-latent-variable-model","title":"Gaussian Process Latent Variable Model Factorization for Context-aware Recommender Systems","date":"2019-12-19","arxiv_id":"1912.09593","repositories_listed":2,"syntology":null},{"url":"/paper/gradient-based-sparse-principal-component","slug":"gradient-based-sparse-principal-component","title":"Gradient-based Sparse Principal Component Analysis with Extensions to Online Learning","date":"2019-11-19","arxiv_id":"1911.08048","repositories_listed":2,"syntology":null},{"url":"/paper/supporting-multi-point-fan-design-with","slug":"supporting-multi-point-fan-design-with","title":"Supporting Multi-point Fan Design with Dimension Reduction","date":"2019-10-20","arxiv_id":"1910.09030","repositories_listed":2,"syntology":null},{"url":"/paper/let-sne-a-hybrid-approach-to-data-embedding","slug":"let-sne-a-hybrid-approach-to-data-embedding","title":"LEt-SNE: A Hybrid Approach To Data Embedding and Visualization of Hyperspectral Imagery","date":"2019-10-19","arxiv_id":"1910.08790","repositories_listed":2,"syntology":null},{"url":"/paper/earthmover-based-manifold-learning-for","slug":"earthmover-based-manifold-learning-for","title":"Earthmover-based manifold learning for analyzing molecular conformation spaces","date":"2019-10-16","arxiv_id":"1911.06107","repositories_listed":2,"syntology":null},{"url":"/paper/covariance-free-partial-least-squares-an","slug":"covariance-free-partial-least-squares-an","title":"Covariance-free Partial Least Squares: An Incremental Dimensionality Reduction Method","date":"2019-10-05","arxiv_id":"1910.02319","repositories_listed":2,"syntology":null},{"url":"/paper/pixelhop-a-successive-subspace-learning-ssl","slug":"pixelhop-a-successive-subspace-learning-ssl","title":"PixelHop: A Successive Subspace Learning (SSL) Method for Object Classification","date":"2019-09-17","arxiv_id":"1909.08190","repositories_listed":2,"syntology":null},{"url":"/paper/sequential-convolutional-recurrent-neural","slug":"sequential-convolutional-recurrent-neural","title":"Sequential Convolutional Recurrent Neural Networks for Fast Automatic Modulation Classification","date":"2019-09-09","arxiv_id":"1909.03050","repositories_listed":2,"syntology":null},{"url":"/paper/fast-and-accurate-network-embeddings-via-very","slug":"fast-and-accurate-network-embeddings-via-very","title":"Fast and Accurate Network Embeddings via Very Sparse Random Projection","date":"2019-08-30","arxiv_id":"1908.11512","repositories_listed":2,"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/fast-and-accurate-network-embeddings-via-very#ran","syntology_url":"https://syntology.ai/paper/1908.11512","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.11512"}},"official":{"repos":["GTmac/FastRP"],"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/online-detection-of-sparse-changes-in-high","slug":"online-detection-of-sparse-changes-in-high","title":"Online Detection of Sparse Changes in High-Dimensional Data Streams Using Tailored Projections","date":"2019-08-06","arxiv_id":"1908.02029","repositories_listed":2,"syntology":null},{"url":"/paper/unscented-gaussian-process-latent-variable","slug":"unscented-gaussian-process-latent-variable","title":"Learning GPLVM with arbitrary kernels using the unscented transformation","date":"2019-07-03","arxiv_id":"1907.01867","repositories_listed":2,"syntology":null},{"url":"/paper/learning-fair-representations-for-kernel","slug":"learning-fair-representations-for-kernel","title":"Learning Fair Representations for Kernel Models","date":"2019-06-27","arxiv_id":"1906.11813","repositories_listed":2,"syntology":null},{"url":"/paper/fisher-and-kernel-fisher-discriminant","slug":"fisher-and-kernel-fisher-discriminant","title":"Fisher and Kernel Fisher Discriminant Analysis: Tutorial","date":"2019-06-22","arxiv_id":"1906.09436","repositories_listed":2,"syntology":null},{"url":"/paper/the-spiked-matrix-model-with-generative","slug":"the-spiked-matrix-model-with-generative","title":"The spiked matrix model with generative priors","date":"2019-05-29","arxiv_id":"1905.12385","repositories_listed":2,"syntology":null},{"url":"/paper/190503329","slug":"190503329","title":"Learning Embeddings into Entropic Wasserstein Spaces","date":"2019-05-08","arxiv_id":"1905.03329","repositories_listed":2,"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":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/190503329#ran","syntology_url":"https://syntology.ai/paper/1905.03329","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.03329"}},"official":null}}],"syntology_records":25,"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":100,"papers_where_code_ran_first_page":"/task/dimensionality-reduction/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":"archive","page":2,"of":34,"url":"/task/dimensionality-reduction/papers/2","json":"/task/dimensionality-reduction/papers/2.json","rows":100},{"order":"archive","page":3,"of":34,"url":"/task/dimensionality-reduction/papers/3","json":"/task/dimensionality-reduction/papers/3.json","rows":100},{"order":"archive","page":4,"of":34,"url":"/task/dimensionality-reduction/papers/4","json":"/task/dimensionality-reduction/papers/4.json","rows":100},{"order":"archive","page":5,"of":34,"url":"/task/dimensionality-reduction/papers/5","json":"/task/dimensionality-reduction/papers/5.json","rows":100},{"order":"archive","page":6,"of":34,"url":"/task/dimensionality-reduction/papers/6","json":"/task/dimensionality-reduction/papers/6.json","rows":100},{"order":"archive","page":7,"of":34,"url":"/task/dimensionality-reduction/papers/7","json":"/task/dimensionality-reduction/papers/7.json","rows":100},{"order":"archive","page":8,"of":34,"url":"/task/dimensionality-reduction/papers/8","json":"/task/dimensionality-reduction/papers/8.json","rows":100},{"order":"archive","page":9,"of":34,"url":"/task/dimensionality-reduction/papers/9","json":"/task/dimensionality-reduction/papers/9.json","rows":100},{"order":"archive","page":10,"of":34,"url":"/task/dimensionality-reduction/papers/10","json":"/task/dimensionality-reduction/papers/10.json","rows":100},{"order":"archive","page":11,"of":34,"url":"/task/dimensionality-reduction/papers/11","json":"/task/dimensionality-reduction/papers/11.json","rows":100},{"order":"archive","page":12,"of":34,"url":"/task/dimensionality-reduction/papers/12","json":"/task/dimensionality-reduction/papers/12.json","rows":100},{"order":"archive","page":13,"of":34,"url":"/task/dimensionality-reduction/papers/13","json":"/task/dimensionality-reduction/papers/13.json","rows":100},{"order":"archive","page":14,"of":34,"url":"/task/dimensionality-reduction/papers/14","json":"/task/dimensionality-reduction/papers/14.json","rows":100},{"order":"archive","page":15,"of":34,"url":"/task/dimensionality-reduction/papers/15","json":"/task/dimensionality-reduction/papers/15.json","rows":100},{"order":"archive","page":16,"of":34,"url":"/task/dimensionality-reduction/papers/16","json":"/task/dimensionality-reduction/papers/16.json","rows":100},{"order":"archive","page":17,"of":34,"url":"/task/dimensionality-reduction/papers/17","json":"/task/dimensionality-reduction/papers/17.json","rows":100},{"order":"archive","page":18,"of":34,"url":"/task/dimensionality-reduction/papers/18","json":"/task/dimensionality-reduction/papers/18.json","rows":100},{"order":"archive","page":19,"of":34,"url":"/task/dimensionality-reduction/papers/19","json":"/task/dimensionality-reduction/papers/19.json","rows":100},{"order":"archive","page":20,"of":34,"url":"/task/dimensionality-reduction/papers/20","json":"/task/dimensionality-reduction/papers/20.json","rows":100},{"order":"archive","page":21,"of":34,"url":"/task/dimensionality-reduction/papers/21","json":"/task/dimensionality-reduction/papers/21.json","rows":100},{"order":"archive","page":22,"of":34,"url":"/task/dimensionality-reduction/papers/22","json":"/task/dimensionality-reduction/papers/22.json","rows":100},{"order":"archive","page":23,"of":34,"url":"/task/dimensionality-reduction/papers/23","json":"/task/dimensionality-reduction/papers/23.json","rows":100},{"order":"archive","page":24,"of":34,"url":"/task/dimensionality-reduction/papers/24","json":"/task/dimensionality-reduction/papers/24.json","rows":100},{"order":"archive","page":25,"of":34,"url":"/task/dimensionality-reduction/papers/25","json":"/task/dimensionality-reduction/papers/25.json","rows":100},{"order":"archive","page":26,"of":34,"url":"/task/dimensionality-reduction/papers/26","json":"/task/dimensionality-reduction/papers/26.json","rows":100},{"order":"archive","page":27,"of":34,"url":"/task/dimensionality-reduction/papers/27","json":"/task/dimensionality-reduction/papers/27.json","rows":100},{"order":"archive","page":28,"of":34,"url":"/task/dimensionality-reduction/papers/28","json":"/task/dimensionality-reduction/papers/28.json","rows":100},{"order":"archive","page":29,"of":34,"url":"/task/dimensionality-reduction/papers/29","json":"/task/dimensionality-reduction/papers/29.json","rows":100},{"order":"archive","page":30,"of":34,"url":"/task/dimensionality-reduction/papers/30","json":"/task/dimensionality-reduction/papers/30.json","rows":100},{"order":"archive","page":31,"of":34,"url":"/task/dimensionality-reduction/papers/31","json":"/task/dimensionality-reduction/papers/31.json","rows":100},{"order":"archive","page":32,"of":34,"url":"/task/dimensionality-reduction/papers/32","json":"/task/dimensionality-reduction/papers/32.json","rows":100},{"order":"archive","page":33,"of":34,"url":"/task/dimensionality-reduction/papers/33","json":"/task/dimensionality-reduction/papers/33.json","rows":100},{"order":"archive","page":34,"of":34,"url":"/task/dimensionality-reduction/papers/34","json":"/task/dimensionality-reduction/papers/34.json","rows":4},{"order":"ran","page":1,"of":1,"url":"/task/dimensionality-reduction/papers/ran/1","json":"/task/dimensionality-reduction/papers/ran/1.json","rows":100}],"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":"5230a1896fe2753cc5b7c7d9359da0ea53d2d25ca2a76d330d4886f0fd5c3b9f","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}