{"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/papers/7","list_of":"/task/dimensionality-reduction","task":"Dimensionality Reduction","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":7,"pages_in_order":34,"rows_per_page":100,"rows":[601,700],"of":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"},"first_page":"/task/dimensionality-reduction","prev":"/task/dimensionality-reduction/papers/6","next":"/task/dimensionality-reduction/papers/8","papers":[{"url":"/paper/auto-encoding-variational-bayes-for-inferring","slug":"auto-encoding-variational-bayes-for-inferring","title":"Auto-Encoding Variational Bayes for Inferring Topics and Visualization","date":"2020-10-19","arxiv_id":"2010.09233","repositories_listed":1,"syntology":null},{"url":"/paper/product-manifold-learning","slug":"product-manifold-learning","title":"Product Manifold Learning","date":"2020-10-19","arxiv_id":"2010.09908","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 2 unverified","sample_list":"/paper/product-manifold-learning#ran","syntology_url":"https://syntology.ai/paper/2010.09908","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.09908"}},"official":{"repos":["sxzhang25/product-manifold-learning"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/sufficient-dimension-reduction-for","slug":"sufficient-dimension-reduction-for","title":"Sufficient dimension reduction for classification using principal optimal transport direction","date":"2020-10-19","arxiv_id":"2010.09921","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/sufficient-dimension-reduction-for#ran","syntology_url":"https://syntology.ai/paper/2010.09921","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.09921"}},"official":{"repos":["ChengzijunAixiaoli/POTD"],"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/understanding-information-processing-in-human","slug":"understanding-information-processing-in-human","title":"Understanding Information Processing in Human Brain by Interpreting Machine Learning Models","date":"2020-10-17","arxiv_id":"2010.08715","repositories_listed":1,"syntology":null},{"url":"/paper/interactive-latent-interpolation-on-mnist","slug":"interactive-latent-interpolation-on-mnist","title":"Interactive Latent Interpolation on MNIST Dataset","date":"2020-10-15","arxiv_id":"2010.07581","repositories_listed":1,"syntology":null},{"url":"/paper/mycorrhiza-genotype-assignment","slug":"mycorrhiza-genotype-assignment","title":"Mycorrhiza: Genotype Assignment usingPhylogenetic Networks","date":"2020-10-14","arxiv_id":"2010.09483","repositories_listed":1,"syntology":null},{"url":"/paper/rapid-robust-principal-component-analysis-cur","slug":"rapid-robust-principal-component-analysis-cur","title":"Rapid Robust Principal Component Analysis: CUR Accelerated Inexact Low Rank Estimation","date":"2020-10-14","arxiv_id":"2010.07422","repositories_listed":1,"syntology":null},{"url":"/paper/challenging-euclidean-topological","slug":"challenging-euclidean-topological","title":"Challenging Euclidean Topological Autoencoders","date":"2020-10-10","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/invertible-manifold-learning-for-dimension-1","slug":"invertible-manifold-learning-for-dimension-1","title":"Invertible Manifold Learning for Dimension Reduction","date":"2020-10-07","arxiv_id":"2010.04012","repositories_listed":1,"syntology":null},{"url":"/paper/less-is-more-faster-and-better-music-version","slug":"less-is-more-faster-and-better-music-version","title":"Less is more: Faster and better music version identification with embedding distillation","date":"2020-10-07","arxiv_id":"2010.03284","repositories_listed":1,"syntology":null},{"url":"/paper/optimal-high-order-tensor-svd-via-tensor","slug":"optimal-high-order-tensor-svd-via-tensor","title":"Optimal High-order Tensor SVD via Tensor-Train Orthogonal Iteration","date":"2020-10-06","arxiv_id":"2010.02482","repositories_listed":1,"syntology":null},{"url":"/paper/algorithms-for-nonnegative-matrix-1","slug":"algorithms-for-nonnegative-matrix-1","title":"Algorithms for Nonnegative Matrix Factorization with the Kullback-Leibler Divergence","date":"2020-10-05","arxiv_id":"2010.01935","repositories_listed":1,"syntology":null},{"url":"/paper/factorized-linear-discriminant-analysis-for-1","slug":"factorized-linear-discriminant-analysis-for-1","title":"Factorized Discriminant Analysis for Genetic Signatures of Neuronal Phenotypes","date":"2020-10-05","arxiv_id":"2010.02171","repositories_listed":1,"syntology":null},{"url":"/paper/perplexity-free-parametric-t-sne","slug":"perplexity-free-parametric-t-sne","title":"Perplexity-free Parametric t-SNE","date":"2020-10-03","arxiv_id":"2010.01359","repositories_listed":1,"syntology":null},{"url":"/paper/covariate-shift-adaptation-in-high","slug":"covariate-shift-adaptation-in-high","title":"Effective Sample Size, Dimensionality, and Generalization in Covariate Shift Adaptation","date":"2020-10-02","arxiv_id":"2010.01184","repositories_listed":1,"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/covariate-shift-adaptation-in-high#ran","syntology_url":"https://syntology.ai/paper/2010.01184","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.01184"}},"official":{"repos":["felipemaiapolo/infoselect"],"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/deep-learning-of-individual-aesthetics","slug":"deep-learning-of-individual-aesthetics","title":"Deep Learning of Individual Aesthetics","date":"2020-09-24","arxiv_id":"2009.12216","repositories_listed":1,"syntology":null},{"url":"/paper/stochastic-neighbor-embedding-with-gaussian","slug":"stochastic-neighbor-embedding-with-gaussian","title":"Stochastic Neighbor Embedding with Gaussian and Student-t Distributions: Tutorial and Survey","date":"2020-09-22","arxiv_id":"2009.10301","repositories_listed":1,"syntology":null},{"url":"/paper/joint-and-progressive-subspace-analysis-jpsa","slug":"joint-and-progressive-subspace-analysis-jpsa","title":"Joint and Progressive Subspace Analysis (JPSA) with Spatial-Spectral Manifold Alignment for Semi-Supervised Hyperspectral Dimensionality Reduction","date":"2020-09-21","arxiv_id":"2009.10003","repositories_listed":1,"syntology":null},{"url":"/paper/an-algorithm-to-attack-neural-network-encoder","slug":"an-algorithm-to-attack-neural-network-encoder","title":"An Algorithm for Out-Of-Distribution Attack to Neural Network Encoder","date":"2020-09-17","arxiv_id":"2009.08016","repositories_listed":1,"syntology":null},{"url":"/paper/laat-locally-aligned-ant-technique-for","slug":"laat-locally-aligned-ant-technique-for","title":"LAAT: Locally Aligned Ant Technique for discovering multiple faint low dimensional structures of varying density","date":"2020-09-17","arxiv_id":"2009.08326","repositories_listed":1,"syntology":null},{"url":"/paper/multidimensional-scaling-sammon-mapping-and","slug":"multidimensional-scaling-sammon-mapping-and","title":"Multidimensional Scaling, Sammon Mapping, and Isomap: Tutorial and Survey","date":"2020-09-17","arxiv_id":"2009.08136","repositories_listed":1,"syntology":null},{"url":"/paper/spectral-flow-on-the-manifold-of-spd-matrices","slug":"spectral-flow-on-the-manifold-of-spd-matrices","title":"Spectral Flow on the Manifold of SPD Matrices for Multimodal Data Processing","date":"2020-09-17","arxiv_id":"2009.08062","repositories_listed":1,"syntology":null},{"url":"/paper/pca-reduced-gaussian-mixture-models-with","slug":"pca-reduced-gaussian-mixture-models-with","title":"PCA Reduced Gaussian Mixture Models with Applications in Superresolution","date":"2020-09-16","arxiv_id":"2009.07520","repositories_listed":1,"syntology":null},{"url":"/paper/ecg-beats-fast-classification-base-on-sparse","slug":"ecg-beats-fast-classification-base-on-sparse","title":"ECG Beats Fast Classification Base on Sparse Dictionaries","date":"2020-09-08","arxiv_id":"2009.03792","repositories_listed":1,"syntology":null},{"url":"/paper/going-beyond-t-sne-exposing-texttt-whatlies","slug":"going-beyond-t-sne-exposing-texttt-whatlies","title":"Going Beyond T-SNE: Exposing \\texttt{whatlies} in Text Embeddings","date":"2020-09-04","arxiv_id":"2009.02113","repositories_listed":1,"syntology":null},{"url":"/paper/exact-and-approximation-algorithms-for-sparse","slug":"exact-and-approximation-algorithms-for-sparse","title":"Exact and Approximation Algorithms for Sparse PCA","date":"2020-08-28","arxiv_id":"2008.12438","repositories_listed":1,"syntology":null},{"url":"/paper/conditional-latent-block-model-a-multivariate","slug":"conditional-latent-block-model-a-multivariate","title":"Conditional Latent Block Model: a Multivariate Time Series Clustering Approach for Autonomous Driving Validation","date":"2020-08-03","arxiv_id":"2008.00946","repositories_listed":1,"syntology":null},{"url":"/paper/in-search-of-the-weirdest-galaxies-in-the","slug":"in-search-of-the-weirdest-galaxies-in-the","title":"In search of the weirdest galaxies in the Universe","date":"2020-07-16","arxiv_id":"2007.08530","repositories_listed":1,"syntology":null},{"url":"/paper/prottrans-towards-cracking-the-language-of","slug":"prottrans-towards-cracking-the-language-of","title":"ProtTrans: Towards Cracking the Language of Life's Code Through Self-Supervised Deep Learning and High Performance Computing","date":"2020-07-13","arxiv_id":"2007.06225","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/prottrans-towards-cracking-the-language-of#ran","syntology_url":"https://syntology.ai/paper/2007.06225","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.06225"}},"official":{"repos":["agemagician/ProtTrans"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/batch-incremental-triplet-sampling-for","slug":"batch-incremental-triplet-sampling-for","title":"Batch-Incremental Triplet Sampling for Training Triplet Networks Using Bayesian Updating Theorem","date":"2020-07-10","arxiv_id":"2007.05610","repositories_listed":1,"syntology":null},{"url":"/paper/numerical-simulation-clustering-and","slug":"numerical-simulation-clustering-and","title":"Numerical simulation, clustering and prediction of multi-component polymer precipitation","date":"2020-07-10","arxiv_id":"2007.07276","repositories_listed":1,"syntology":null},{"url":"/paper/trajectories-bifurcations-and-pseudotime-in","slug":"trajectories-bifurcations-and-pseudotime-in","title":"Trajectories, bifurcations and pseudotime in large clinical datasets: applications to myocardial infarction and diabetes data","date":"2020-07-07","arxiv_id":"2007.03788","repositories_listed":1,"syntology":null},{"url":"/paper/offline-versus-online-triplet-mining-based-on","slug":"offline-versus-online-triplet-mining-based-on","title":"Offline versus Online Triplet Mining based on Extreme Distances of Histopathology Patches","date":"2020-07-04","arxiv_id":"2007.02200","repositories_listed":1,"syntology":null},{"url":"/paper/improving-interpretability-of-cnn-models","slug":"improving-interpretability-of-cnn-models","title":"Invertible Concept-based Explanations for CNN Models with Non-negative Concept Activation Vectors","date":"2020-06-27","arxiv_id":"2006.15417","repositories_listed":1,"syntology":null},{"url":"/paper/a-metric-on-directed-graphs-and-markov-chains","slug":"a-metric-on-directed-graphs-and-markov-chains","title":"A metric on directed graphs and Markov chains based on hitting probabilities","date":"2020-06-25","arxiv_id":"2006.14482","repositories_listed":1,"syntology":null},{"url":"/paper/neural-decomposition-functional-anova-with","slug":"neural-decomposition-functional-anova-with","title":"Neural Decomposition: Functional ANOVA with Variational Autoencoders","date":"2020-06-25","arxiv_id":"2006.14293","repositories_listed":1,"syntology":null},{"url":"/paper/abid-angle-based-intrinsic-dimensionality","slug":"abid-angle-based-intrinsic-dimensionality","title":"ABID: Angle Based Intrinsic Dimensionality","date":"2020-06-23","arxiv_id":"2006.12880","repositories_listed":1,"syntology":null},{"url":"/paper/supervised-dimensionality-reduction-by-a","slug":"supervised-dimensionality-reduction-by-a","title":"Supervised dimensionality reduction by a Linear Discriminant Analysis on pre-trained CNN features","date":"2020-06-22","arxiv_id":"2006.12127","repositories_listed":1,"syntology":null},{"url":"/paper/quantile-quantile-embedding-for-distribution","slug":"quantile-quantile-embedding-for-distribution","title":"Quantile-Quantile Embedding for Distribution Transformation and Manifold Embedding with Ability to Choose the Embedding Distribution","date":"2020-06-19","arxiv_id":"2006.11385","repositories_listed":1,"syntology":null},{"url":"/paper/a-representational-model-of-grid-cells-based","slug":"a-representational-model-of-grid-cells-based","title":"On Path Integration of Grid Cells: Group Representation and Isotropic Scaling","date":"2020-06-18","arxiv_id":"2006.10259","repositories_listed":1,"syntology":null},{"url":"/paper/a-multi-objective-based-approach-for-fair","slug":"a-multi-objective-based-approach-for-fair","title":"Analysis of Trade-offs in Fair Principal Component Analysis Based on Multi-objective Optimization","date":"2020-06-11","arxiv_id":"2006.06137","repositories_listed":1,"syntology":null},{"url":"/paper/deep-dimension-reduction-for-supervised","slug":"deep-dimension-reduction-for-supervised","title":"Deep Dimension Reduction for Supervised Representation Learning","date":"2020-06-10","arxiv_id":"2006.05865","repositories_listed":1,"syntology":null},{"url":"/paper/novelty-detection-via-robust-variational","slug":"novelty-detection-via-robust-variational","title":"Novelty Detection via Robust Variational Autoencoding","date":"2020-06-09","arxiv_id":"2006.05534","repositories_listed":1,"syntology":null},{"url":"/paper/generalized-penalty-for-circular-coordinate","slug":"generalized-penalty-for-circular-coordinate","title":"Generalized Penalty for Circular Coordinate Representation","date":"2020-06-03","arxiv_id":"2006.02554","repositories_listed":1,"syntology":null},{"url":"/paper/semi-supervised-embedding-learning-for-high","slug":"semi-supervised-embedding-learning-for-high","title":"Semi-supervised Embedding Learning for High-dimensional Bayesian Optimization","date":"2020-05-29","arxiv_id":"2005.14601","repositories_listed":1,"syntology":null},{"url":"/paper/dartminhash-fast-sketching-for-weighted-sets","slug":"dartminhash-fast-sketching-for-weighted-sets","title":"DartMinHash: Fast Sketching for Weighted Sets","date":"2020-05-23","arxiv_id":"2005.11547","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-canonical-correlation-analysis","slug":"adversarial-canonical-correlation-analysis","title":"Adversarial Canonical Correlation Analysis","date":"2020-05-20","arxiv_id":"2005.10349","repositories_listed":1,"syntology":null},{"url":"/paper/detection-and-retrieval-of-out-of","slug":"detection-and-retrieval-of-out-of","title":"Detection and Retrieval of Out-of-Distribution Objects in Semantic Segmentation","date":"2020-05-14","arxiv_id":"2005.06831","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/detection-and-retrieval-of-out-of#ran","syntology_url":"https://syntology.ai/paper/2005.06831","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.06831"}},"official":{"repos":["RonMcKay/OODRetrieval"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/laplacian-eigenmaps-and-spectral-techniques","slug":"laplacian-eigenmaps-and-spectral-techniques","title":"Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering","date":"2020-05-13","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/solving-large-scale-sparse-pca-to-certifiable","slug":"solving-large-scale-sparse-pca-to-certifiable","title":"Solving Large-Scale Sparse PCA to Certifiable (Near) Optimality","date":"2020-05-11","arxiv_id":"2005.05195","repositories_listed":1,"syntology":null},{"url":"/paper/supervision-and-source-domain-impact-on","slug":"supervision-and-source-domain-impact-on","title":"Supervision and Source Domain Impact on Representation Learning: A Histopathology Case Study","date":"2020-05-10","arxiv_id":"2005.08629","repositories_listed":1,"syntology":null},{"url":"/paper/renormalized-mutual-information-for","slug":"renormalized-mutual-information-for","title":"Renormalized Mutual Information for Artificial Scientific Discovery","date":"2020-05-04","arxiv_id":"2005.01912","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/renormalized-mutual-information-for#ran","syntology_url":"https://syntology.ai/paper/2005.01912","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.01912"}},"official":{"repos":["lsarra/rmi"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/on-time-series-representations-for-multi","slug":"on-time-series-representations-for-multi","title":"On time series representations for multi-label NILM","date":"2020-05-02","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/bayesopt-adversarial-attack","slug":"bayesopt-adversarial-attack","title":"BayesOpt Adversarial Attack","date":"2020-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/sign-bits-are-all-you-need-for-black-box","slug":"sign-bits-are-all-you-need-for-black-box","title":"Sign Bits Are All You Need for Black-Box Attacks","date":"2020-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/tired-of-topic-models-clusters-of-pretrained","slug":"tired-of-topic-models-clusters-of-pretrained","title":"Tired of Topic Models? Clusters of Pretrained Word Embeddings Make for Fast and Good Topics too!","date":"2020-04-30","arxiv_id":"2004.14914","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/tired-of-topic-models-clusters-of-pretrained#ran","syntology_url":"https://syntology.ai/paper/2004.14914","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.14914"}},"official":{"repos":["adalmia96/Cluster-Analysis"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/ivis-dimensionality-reduction-framework-for","slug":"ivis-dimensionality-reduction-framework-for","title":"ivis Dimensionality Reduction Framework for Biomacromolecular Simulations","date":"2020-04-22","arxiv_id":"2004.10718","repositories_listed":1,"syntology":null},{"url":"/paper/latent-regularization-for-feature-selection","slug":"latent-regularization-for-feature-selection","title":"Latent regularization for feature selection using kernel methods in tumor classification","date":"2020-04-10","arxiv_id":"2004.04866","repositories_listed":1,"syntology":null},{"url":"/paper/supervised-autoencoders-learn-robust-joint","slug":"supervised-autoencoders-learn-robust-joint","title":"Estimating a Brain Network Predictive of Stress and Genotype with Supervised Autoencoders","date":"2020-04-10","arxiv_id":"2004.05209","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/supervised-autoencoders-learn-robust-joint#ran","syntology_url":"https://syntology.ai/paper/2004.05209","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.05209"}},"official":{"repos":["carlson-lab/encodedSupervision"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/tensorprojection-layer-a-tensor-based","slug":"tensorprojection-layer-a-tensor-based","title":"TensorProjection Layer: A Tensor-Based Dimension Reduction Method in Deep Neural Networks","date":"2020-04-09","arxiv_id":"2004.04454","repositories_listed":1,"syntology":null},{"url":"/paper/geomstats-a-python-package-for-riemannian-2","slug":"geomstats-a-python-package-for-riemannian-2","title":"Geomstats: A Python Package for Riemannian Geometry in Machine Learning","date":"2020-04-07","arxiv_id":"2004.04667","repositories_listed":1,"syntology":null},{"url":"/paper/backprojection-for-training-feedforward","slug":"backprojection-for-training-feedforward","title":"Backprojection for Training Feedforward Neural Networks in the Input and Feature Spaces","date":"2020-04-05","arxiv_id":"2004.04573","repositories_listed":1,"syntology":null},{"url":"/paper/fisher-discriminant-triplet-and-contrastive","slug":"fisher-discriminant-triplet-and-contrastive","title":"Fisher Discriminant Triplet and Contrastive Losses for Training Siamese Networks","date":"2020-04-05","arxiv_id":"2004.04674","repositories_listed":1,"syntology":null},{"url":"/paper/weighted-fisher-discriminant-analysis-in-the","slug":"weighted-fisher-discriminant-analysis-in-the","title":"Weighted Fisher Discriminant Analysis in the Input and Feature Spaces","date":"2020-04-04","arxiv_id":"2004.01857","repositories_listed":1,"syntology":null},{"url":"/paper/suod-a-scalable-unsupervised-outlier","slug":"suod-a-scalable-unsupervised-outlier","title":"SUOD: Accelerating Large-Scale Unsupervised Heterogeneous Outlier Detection","date":"2020-03-11","arxiv_id":"2003.05731","repositories_listed":1,"syntology":null},{"url":"/paper/supervised-domain-adaptation-using-graph","slug":"supervised-domain-adaptation-using-graph","title":"Supervised Domain Adaptation using Graph Embedding","date":"2020-03-09","arxiv_id":"2003.04063","repositories_listed":1,"syntology":null},{"url":"/paper/basisvae-translation-invariant-feature-level","slug":"basisvae-translation-invariant-feature-level","title":"BasisVAE: Translation-invariant feature-level clustering with Variational Autoencoders","date":"2020-03-06","arxiv_id":"2003.03462","repositories_listed":1,"syntology":null},{"url":"/paper/dimensionality-reduction-to-maximize","slug":"dimensionality-reduction-to-maximize","title":"Dimensionality reduction to maximize prediction generalization capability","date":"2020-03-01","arxiv_id":"2003.00470","repositories_listed":1,"syntology":null},{"url":"/paper/statistical-power-for-cluster-analysis","slug":"statistical-power-for-cluster-analysis","title":"Statistical power for cluster analysis","date":"2020-03-01","arxiv_id":"2003.00381","repositories_listed":1,"syntology":null},{"url":"/paper/high-dimensional-feature-selection-for","slug":"high-dimensional-feature-selection-for","title":"High-Dimensional Feature Selection for Genomic Datasets","date":"2020-02-27","arxiv_id":"2002.12104","repositories_listed":1,"syntology":null},{"url":"/paper/t-visne-interactive-assessment-and","slug":"t-visne-interactive-assessment-and","title":"t-viSNE: Interactive Assessment and Interpretation of t-SNE Projections","date":"2020-02-17","arxiv_id":"2002.06910","repositories_listed":1,"syntology":null},{"url":"/paper/molecular-insights-from-conformational","slug":"molecular-insights-from-conformational","title":"Molecular Insights from Conformational Ensembles via Machine Learning","date":"2020-02-04","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/ncvis-noise-contrastive-approach-for-scalable","slug":"ncvis-noise-contrastive-approach-for-scalable","title":"NCVis: Noise Contrastive Approach for Scalable Visualization","date":"2020-01-30","arxiv_id":"2001.11411","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-visual-patterns-in-projected-human","slug":"exploring-visual-patterns-in-projected-human","title":"ProjectionPathExplorer: Exploring Visual Patterns in Projected Decision-Making Paths","date":"2020-01-20","arxiv_id":"2001.08372","repositories_listed":1,"syntology":null},{"url":"/paper/supervised-discriminative-sparse-pca-with","slug":"supervised-discriminative-sparse-pca-with","title":"Supervised Discriminative Sparse PCA with Adaptive Neighbors for Dimensionality Reduction","date":"2020-01-09","arxiv_id":"2001.03103","repositories_listed":1,"syntology":null},{"url":"/paper/interpreting-lstm-prediction-on-solar-flare","slug":"interpreting-lstm-prediction-on-solar-flare","title":"Interpreting LSTM Prediction on Solar Flare Eruption with Time-series Clustering","date":"2019-12-27","arxiv_id":"1912.12360","repositories_listed":1,"syntology":null},{"url":"/paper/interpretable-embeddings-from-molecular","slug":"interpretable-embeddings-from-molecular","title":"Interpretable Embeddings From Molecular Simulations Using Gaussian Mixture Variational Autoencoders","date":"2019-12-22","arxiv_id":"1912.12175","repositories_listed":1,"syntology":null},{"url":"/paper/deep-learning-to-discover-and-predict","slug":"deep-learning-to-discover-and-predict","title":"Deep learning to discover and predict dynamics on an inertial manifold","date":"2019-12-20","arxiv_id":"2001.04263","repositories_listed":1,"syntology":null},{"url":"/paper/from-deep-learning-to-mechanistic-1","slug":"from-deep-learning-to-mechanistic-1","title":"From deep learning to mechanistic understanding in neuroscience: the structure of retinal prediction","date":"2019-12-12","arxiv_id":"1912.06207","repositories_listed":1,"syntology":null},{"url":"/paper/the-wasserstein-fourier-distance-for","slug":"the-wasserstein-fourier-distance-for","title":"The Wasserstein-Fourier Distance for Stationary Time Series","date":"2019-12-11","arxiv_id":"1912.05509","repositories_listed":1,"syntology":null},{"url":"/paper/self-organizing-nebulous-growths-for-robust","slug":"self-organizing-nebulous-growths-for-robust","title":"Self Organizing Nebulous Growths for Robust and Incremental Data Visualization","date":"2019-12-09","arxiv_id":"1912.04896","repositories_listed":1,"syntology":null},{"url":"/paper/control-of-ecological-outcomes-through","slug":"control-of-ecological-outcomes-through","title":"Control of ecological outcomes through deliberate parameter changes in a model of the gut microbiome","date":"2019-12-07","arxiv_id":"1912.03412","repositories_listed":1,"syntology":null},{"url":"/paper/using-dimensionality-reduction-to-optimize-t","slug":"using-dimensionality-reduction-to-optimize-t","title":"Using Dimensionality Reduction to Optimize t-SNE","date":"2019-12-02","arxiv_id":"1912.01098","repositories_listed":1,"syntology":null},{"url":"/paper/tight-dimensionality-reduction-for-sketching","slug":"tight-dimensionality-reduction-for-sketching","title":"Tight Dimensionality Reduction for Sketching Low Degree Polynomial Kernels","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-discovery-of-temporal-structure-1","slug":"unsupervised-discovery-of-temporal-structure-1","title":"Unsupervised Discovery of Temporal Structure in Noisy Data with Dynamical Components Analysis","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/safe-squeezing-for-antisparse-coding","slug":"safe-squeezing-for-antisparse-coding","title":"Safe squeezing for antisparse coding","date":"2019-11-18","arxiv_id":"1911.07508","repositories_listed":1,"syntology":null},{"url":"/paper/manifold-denoising-by-nonlinear-robust","slug":"manifold-denoising-by-nonlinear-robust","title":"Manifold Denoising by Nonlinear Robust Principal Component Analysis","date":"2019-11-10","arxiv_id":"1911.03831","repositories_listed":1,"syntology":null},{"url":"/paper/graph-convolutional-networks-meet-with-high","slug":"graph-convolutional-networks-meet-with-high","title":"Graph Convolutional Networks Meet with High Dimensionality Reduction","date":"2019-11-07","arxiv_id":"1911.02928","repositories_listed":1,"syntology":null},{"url":"/paper/solving-nmf-with-smoothness-and-sparsity","slug":"solving-nmf-with-smoothness-and-sparsity","title":"Solving NMF with smoothness and sparsity constraints using PALM","date":"2019-10-31","arxiv_id":"1910.14576","repositories_listed":1,"syntology":null},{"url":"/paper/autoencoding-with-xcsf","slug":"autoencoding-with-xcsf","title":"Autoencoding with a Classifier System","date":"2019-10-23","arxiv_id":"1910.10579","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-boosting-based-autoencoder","slug":"unsupervised-boosting-based-autoencoder","title":"Unsupervised Boosting-based Autoencoder Ensembles for Outlier Detection","date":"2019-10-22","arxiv_id":"1910.09754","repositories_listed":1,"syntology":null},{"url":"/paper/multi-band-multi-resolution-fully","slug":"multi-band-multi-resolution-fully","title":"Multi-Band Multi-Resolution Fully Convolutional Neural Networks for Singing Voice Separation","date":"2019-10-21","arxiv_id":"1910.09266","repositories_listed":1,"syntology":null},{"url":"/paper/roweis-discriminant-analysis-a-generalized","slug":"roweis-discriminant-analysis-a-generalized","title":"Roweis Discriminant Analysis: A Generalized Subspace Learning Method","date":"2019-10-11","arxiv_id":"1910.05437","repositories_listed":1,"syntology":null},{"url":"/paper/specializing-word-embeddings-for-parsing-by","slug":"specializing-word-embeddings-for-parsing-by","title":"Specializing Word Embeddings (for Parsing) by Information Bottleneck","date":"2019-10-01","arxiv_id":"1910.00163","repositories_listed":1,"syntology":null},{"url":"/paper/trimap-large-scale-dimensionality-reduction","slug":"trimap-large-scale-dimensionality-reduction","title":"TriMap: Large-scale Dimensionality Reduction Using Triplets","date":"2019-10-01","arxiv_id":"1910.00204","repositories_listed":1,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/trimap-large-scale-dimensionality-reduction#ran","syntology_url":"https://syntology.ai/paper/1910.00204","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.00204"}},"official":{"repos":["eamid/trimap"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-quotient-space-formulation-for-statistical","slug":"a-quotient-space-formulation-for-statistical","title":"A Quotient Space Formulation for Generative Statistical Analysis of Graphical Data","date":"2019-09-30","arxiv_id":"1909.12907","repositories_listed":1,"syntology":null},{"url":"/paper/capacity-preserving-mapping-for-high","slug":"capacity-preserving-mapping-for-high","title":"Capacity Preserving Mapping for High-dimensional Data Visualization","date":"2019-09-29","arxiv_id":"1909.13322","repositories_listed":1,"syntology":null},{"url":"/paper/function-preserving-projection-for-scalable","slug":"function-preserving-projection-for-scalable","title":"Function Preserving Projection for Scalable Exploration of High-Dimensional Data","date":"2019-09-25","arxiv_id":"1909.11804","repositories_listed":1,"syntology":null},{"url":"/paper/190910228","slug":"190910228","title":"Manifold Fitting under Unbounded Noise","date":"2019-09-23","arxiv_id":"1909.10228","repositories_listed":1,"syntology":null},{"url":"/paper/deepview-visualizing-the-behavior-of-deep","slug":"deepview-visualizing-the-behavior-of-deep","title":"DeepView: Visualizing Classification Boundaries of Deep Neural Networks as Scatter Plots Using Discriminative Dimensionality Reduction","date":"2019-09-19","arxiv_id":"1909.09154","repositories_listed":1,"syntology":null}],"record_sha256":"2db0be6e1e71af1871fc1e838c86db0de2cf988c2382f4348a2752882612b299","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}