{"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/6","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":6,"pages_in_order":34,"rows_per_page":100,"rows":[501,600],"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/5","next":"/task/dimensionality-reduction/papers/7","papers":[{"url":"/paper/identifiable-energy-based-representations-an","slug":"identifiable-energy-based-representations-an","title":"Identifiable Energy-based Representations: An Application to Estimating Heterogeneous Causal Effects","date":"2021-08-06","arxiv_id":"2108.03039","repositories_listed":1,"syntology":null},{"url":"/paper/discovering-semantics-in-super-resolution","slug":"discovering-semantics-in-super-resolution","title":"Discovering Distinctive \"Semantics\" in Super-Resolution Networks","date":"2021-08-01","arxiv_id":"2108.00406","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-multidimensional-functional-data","slug":"efficient-multidimensional-functional-data","title":"Efficient Multidimensional Functional Data Analysis Using Marginal Product Basis Systems","date":"2021-07-30","arxiv_id":"2107.14728","repositories_listed":1,"syntology":null},{"url":"/paper/a-local-approach-to-parameter-space-reduction","slug":"a-local-approach-to-parameter-space-reduction","title":"A local approach to parameter space reduction for regression and classification tasks","date":"2021-07-22","arxiv_id":"2107.10867","repositories_listed":1,"syntology":null},{"url":"/paper/mini-data-driven-deep-arbitrary-polynomial","slug":"mini-data-driven-deep-arbitrary-polynomial","title":"Deep Adaptive Arbitrary Polynomial Chaos Expansion: A Mini-data-driven Semi-supervised Method for Uncertainty Quantification","date":"2021-07-22","arxiv_id":"2107.10428","repositories_listed":1,"syntology":null},{"url":"/paper/deep-learning-for-reduced-order-modelling-and","slug":"deep-learning-for-reduced-order-modelling-and","title":"Deep Learning for Reduced Order Modelling and Efficient Temporal Evolution of Fluid Simulations","date":"2021-07-09","arxiv_id":"2107.04556","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/deep-learning-for-reduced-order-modelling-and#ran","syntology_url":"https://syntology.ai/paper/2107.04556","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.04556"}},"official":{"repos":["pranshupant/DL-ROM"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/generative-locally-linear-embedding-a-module","slug":"generative-locally-linear-embedding-a-module","title":"Generative locally linear embedding: A module for manifold unfolding and visualization","date":"2021-07-06","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/ucsl-a-machine-learning-expectation","slug":"ucsl-a-machine-learning-expectation","title":"UCSL : A Machine Learning Expectation-Maximization framework for Unsupervised Clustering driven by Supervised Learning","date":"2021-07-05","arxiv_id":"2107.01988","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/ucsl-a-machine-learning-expectation#ran","syntology_url":"https://syntology.ai/paper/2107.01988","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.01988"}},"official":{"repos":["neurospin-projects/2021_rlouiset_ucsl"],"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/interactive-dimensionality-reduction-for","slug":"interactive-dimensionality-reduction-for","title":"Interactive Dimensionality Reduction for Comparative Analysis","date":"2021-06-29","arxiv_id":"2106.15481","repositories_listed":1,"syntology":null},{"url":"/paper/feature-grouping-and-sparse-principal","slug":"feature-grouping-and-sparse-principal","title":"Feature Grouping and Sparse Principal Component Analysis with Truncated Regularization","date":"2021-06-25","arxiv_id":"2106.13685","repositories_listed":1,"syntology":null},{"url":"/paper/objective-discovery-of-dominant-dynamical","slug":"objective-discovery-of-dominant-dynamical","title":"Objective discovery of dominant dynamical processes with intelligible machine learning","date":"2021-06-21","arxiv_id":"2106.12963","repositories_listed":1,"syntology":null},{"url":"/paper/low-rank-characteristic-tensor-density","slug":"low-rank-characteristic-tensor-density","title":"Low-rank Characteristic Tensor Density Estimation Part II: Compression and Latent Density Estimation","date":"2021-06-20","arxiv_id":"2106.10591","repositories_listed":1,"syntology":null},{"url":"/paper/skfac-training-neural-networks-with-faster","slug":"skfac-training-neural-networks-with-faster","title":"SKFAC: Training Neural Networks With Faster Kronecker-Factored Approximate Curvature","date":"2021-06-19","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/disentangling-identifiable-features-from","slug":"disentangling-identifiable-features-from","title":"Disentangling Identifiable Features from Noisy Data with Structured Nonlinear ICA","date":"2021-06-17","arxiv_id":"2106.09620","repositories_listed":1,"syntology":{"n":40,"n_ran":23,"n_constructed":0,"n_ran_checked":5,"n_instrument":18,"n_unverified":17,"n_honours":4,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"23 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 4 honoured, 1 violated, 0 with no contract checked; 18 where Syntology's instrument failed) · 17 unverified","sample_list":"/paper/disentangling-identifiable-features-from#ran","syntology_url":"https://syntology.ai/paper/2106.09620","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.09620"}},"official":{"repos":["HHalva/snica"],"state":"official (archive's flag): 23 ran","n_ran":23,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":17,"ran_from_kinds":["official"]}}},{"url":"/paper/pykale-knowledge-aware-machine-learning-from","slug":"pykale-knowledge-aware-machine-learning-from","title":"PyKale: Knowledge-Aware Machine Learning from Multiple Sources in Python","date":"2021-06-17","arxiv_id":"2106.09756","repositories_listed":1,"syntology":null},{"url":"/paper/augmented-tensor-decomposition-with","slug":"augmented-tensor-decomposition-with","title":"ATD: Augmenting CP Tensor Decomposition by Self Supervision","date":"2021-06-15","arxiv_id":"2106.07900","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/augmented-tensor-decomposition-with#ran","syntology_url":"https://syntology.ai/paper/2106.07900","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.07900"}},"official":{"repos":["ycq091044/atd"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/computer-aided-interpretable-features-for","slug":"computer-aided-interpretable-features-for","title":"Computer-aided Interpretable Features for Leaf Image Classification","date":"2021-06-15","arxiv_id":"2106.08077","repositories_listed":1,"syntology":null},{"url":"/paper/humap-hierarchical-uniform-manifold","slug":"humap-hierarchical-uniform-manifold","title":"HUMAP: Hierarchical Uniform Manifold Approximation and Projection","date":"2021-06-14","arxiv_id":"2106.07718","repositories_listed":1,"syntology":null},{"url":"/paper/improving-metric-dimensionality-reduction","slug":"improving-metric-dimensionality-reduction","title":"Improving Metric Dimensionality Reduction with Distributed Topology","date":"2021-06-14","arxiv_id":"2106.07613","repositories_listed":1,"syntology":null},{"url":"/paper/distributionally-robust-optimization-with-3","slug":"distributionally-robust-optimization-with-3","title":"Distributionally Robust Optimization with Markovian Data","date":"2021-06-12","arxiv_id":"2106.06741","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-behaviour-discovery-with-quality","slug":"unsupervised-behaviour-discovery-with-quality","title":"Unsupervised Behaviour Discovery with Quality-Diversity Optimisation","date":"2021-06-10","arxiv_id":"2106.05648","repositories_listed":1,"syntology":null},{"url":"/paper/large-scale-optimal-transport-map-estimation-1","slug":"large-scale-optimal-transport-map-estimation-1","title":"Large-scale optimal transport map estimation using projection pursuit","date":"2021-06-09","arxiv_id":"2106.05838","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/large-scale-optimal-transport-map-estimation-1#ran","syntology_url":"https://syntology.ai/paper/2106.05838","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.05838"}},"official":{"repos":["ChengzijunAixiaoli/PPMM"],"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/sirius-a-mutual-information-tool-for","slug":"sirius-a-mutual-information-tool-for","title":"Sirius: Visualization of Mixed Features as a Mutual Information Network Graph","date":"2021-06-09","arxiv_id":"2106.05260","repositories_listed":1,"syntology":null},{"url":"/paper/evaluating-meta-feature-selection-for-the","slug":"evaluating-meta-feature-selection-for-the","title":"Evaluating Meta-Feature Selection for the Algorithm Recommendation Problem","date":"2021-06-07","arxiv_id":"2106.03954","repositories_listed":1,"syntology":null},{"url":"/paper/horopca-hyperbolic-dimensionality-reduction","slug":"horopca-hyperbolic-dimensionality-reduction","title":"HoroPCA: Hyperbolic Dimensionality Reduction via Horospherical Projections","date":"2021-06-07","arxiv_id":"2106.03306","repositories_listed":1,"syntology":{"n":29,"n_ran":23,"n_constructed":0,"n_ran_checked":1,"n_instrument":22,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":29,"phrase":"23 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; 22 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/horopca-hyperbolic-dimensionality-reduction#ran","syntology_url":"https://syntology.ai/paper/2106.03306","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.03306"}},"official":null}},{"url":"/paper/matrix-factorisation-and-the-interpretation","slug":"matrix-factorisation-and-the-interpretation","title":"Matrix factorisation and the interpretation of geodesic distance","date":"2021-06-02","arxiv_id":"2106.01260","repositories_listed":1,"syntology":null},{"url":"/paper/skfac-training-neural-networks-with-faster-1","slug":"skfac-training-neural-networks-with-faster-1","title":"SKFAC:Training Neural Networks with Faster Kronecker-Factored Approximate Curvature","date":"2021-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/wicluster-passive-indoor-2d-3d-positioning","slug":"wicluster-passive-indoor-2d-3d-positioning","title":"WiCluster: Passive Indoor 2D/3D Positioning using WiFi without Precise Labels","date":"2021-05-31","arxiv_id":"2107.01002","repositories_listed":1,"syntology":null},{"url":"/paper/visualizing-representations-of-adversarially","slug":"visualizing-representations-of-adversarially","title":"Visualizing Representations of Adversarially Perturbed Inputs","date":"2021-05-28","arxiv_id":"2105.14116","repositories_listed":1,"syntology":null},{"url":"/paper/estimating-leverage-scores-via-rank-revealing","slug":"estimating-leverage-scores-via-rank-revealing","title":"Estimating leverage scores via rank revealing methods and randomization","date":"2021-05-23","arxiv_id":"2105.11004","repositories_listed":1,"syntology":{"n":6,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/estimating-leverage-scores-via-rank-revealing#ran","syntology_url":"https://syntology.ai/paper/2105.11004","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.11004"}},"official":{"repos":["IBM/pylspack"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/a-clustering-framework-for-residential","slug":"a-clustering-framework-for-residential","title":"A Clustering Framework for Residential Electric Demand Profiles","date":"2021-05-17","arxiv_id":"2105.08537","repositories_listed":1,"syntology":null},{"url":"/paper/a-feasibility-study-of-a-hyperparameter","slug":"a-feasibility-study-of-a-hyperparameter","title":"A hyperparameter-tuning approach to automated inverse planning","date":"2021-05-14","arxiv_id":"2105.07024","repositories_listed":1,"syntology":null},{"url":"/paper/empirical-evaluation-of-pre-trained","slug":"empirical-evaluation-of-pre-trained","title":"Empirical Evaluation of Pre-trained Transformers for Human-Level NLP: The Role of Sample Size and Dimensionality","date":"2021-05-07","arxiv_id":"2105.03484","repositories_listed":1,"syntology":null},{"url":"/paper/high-dimensional-functional-graphical-model","slug":"high-dimensional-functional-graphical-model","title":"High-dimensional Functional Graphical Model Structure Learning via Neighborhood Selection Approach","date":"2021-05-06","arxiv_id":"2105.02487","repositories_listed":1,"syntology":null},{"url":"/paper/pseudocell-tracer-a-method-for-inferring","slug":"pseudocell-tracer-a-method-for-inferring","title":"Pseudocell Tracer—A method for inferring dynamic trajectories using scRNAseq and its application to B cells undergoing immunoglobulin class switch recombination","date":"2021-05-03","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/stochastic-mutual-information-gradient","slug":"stochastic-mutual-information-gradient","title":"Stochastic Mutual Information Gradient Estimation for Dimensionality Reduction Networks","date":"2021-05-01","arxiv_id":"2105.00191","repositories_listed":1,"syntology":null},{"url":"/paper/nonlinear-level-set-learning-for-function","slug":"nonlinear-level-set-learning-for-function","title":"Nonlinear Level Set Learning for Function Approximation on Sparse Data with Applications to Parametric Differential Equations","date":"2021-04-29","arxiv_id":"2104.14072","repositories_listed":1,"syntology":null},{"url":"/paper/structured-sparse-non-negative-matrix","slug":"structured-sparse-non-negative-matrix","title":"Structured Sparse Non-negative Matrix Factorization with L20-Norm for scRNA-seq Data Analysis","date":"2021-04-27","arxiv_id":"2104.13171","repositories_listed":1,"syntology":null},{"url":"/paper/a-tutorial-on-generalized-eigendecomposition","slug":"a-tutorial-on-generalized-eigendecomposition","title":"A tutorial on generalized eigendecomposition for denoising, contrast enhancement, and dimension reduction in multichannel electrophysiology","date":"2021-04-26","arxiv_id":"2104.12356","repositories_listed":1,"syntology":null},{"url":"/paper/equivariant-wavelets-fast-rotation-and","slug":"equivariant-wavelets-fast-rotation-and","title":"Equivariant Wavelets: Fast Rotation and Translation Invariant Wavelet Scattering Transforms","date":"2021-04-22","arxiv_id":"2104.11244","repositories_listed":1,"syntology":null},{"url":"/paper/on-geodesic-distances-and-contextual","slug":"on-geodesic-distances-and-contextual","title":"On Geodesic Distances and Contextual Embedding Compression for Text Classification","date":"2021-04-22","arxiv_id":"2104.11295","repositories_listed":1,"syntology":null},{"url":"/paper/towards-exploratory-landscape-analysis-for","slug":"towards-exploratory-landscape-analysis-for","title":"Towards Exploratory Landscape Analysis for Large-scale Optimization: A Dimensionality Reduction Framework","date":"2021-04-21","arxiv_id":"2104.10301","repositories_listed":1,"syntology":null},{"url":"/paper/decoding-the-shift-invariant-data","slug":"decoding-the-shift-invariant-data","title":"Decoding the shift-invariant data: applications for band-excitation scanning probe microscopy","date":"2021-04-20","arxiv_id":"2104.10207","repositories_listed":1,"syntology":null},{"url":"/paper/quantum-algorithms-for-data-representation","slug":"quantum-algorithms-for-data-representation","title":"Quantum algorithms for SVD-based data representation and analysis","date":"2021-04-19","arxiv_id":"2104.08987","repositories_listed":1,"syntology":null},{"url":"/paper/capturing-patterns-of-variation-unique-to-a","slug":"capturing-patterns-of-variation-unique-to-a","title":"Capturing patterns of variation unique to a specific dataset","date":"2021-04-16","arxiv_id":"2104.08157","repositories_listed":1,"syntology":null},{"url":"/paper/classifying-herbal-medicine-origins-by","slug":"classifying-herbal-medicine-origins-by","title":"Classifying herbal medicine origins by temporal and spectral data mining of electronic nose","date":"2021-04-14","arxiv_id":"2104.06640","repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-bayesian-autoencoders-with-mcmc","slug":"revisiting-bayesian-autoencoders-with-mcmc","title":"Revisiting Bayesian Autoencoders with MCMC","date":"2021-04-13","arxiv_id":"2104.05915","repositories_listed":1,"syntology":null},{"url":"/paper/adversarially-trained-nonnegative-matrix","slug":"adversarially-trained-nonnegative-matrix","title":"Adversarially-Trained Nonnegative Matrix Factorization","date":"2021-04-10","arxiv_id":"2104.04757","repositories_listed":1,"syntology":null},{"url":"/paper/prosobeast-prosody-annotation-tool","slug":"prosobeast-prosody-annotation-tool","title":"ProsoBeast Prosody Annotation Tool","date":"2021-04-06","arxiv_id":"2104.02397","repositories_listed":1,"syntology":null},{"url":"/paper/verb-visualizing-and-interpreting-bias","slug":"verb-visualizing-and-interpreting-bias","title":"VERB: Visualizing and Interpreting Bias Mitigation Techniques for Word Representations","date":"2021-04-06","arxiv_id":"2104.02797","repositories_listed":1,"syntology":null},{"url":"/paper/generative-locally-linear-embedding","slug":"generative-locally-linear-embedding","title":"Generative Locally Linear Embedding","date":"2021-04-04","arxiv_id":"2104.01525","repositories_listed":1,"syntology":null},{"url":"/paper/deep-learning-of-conjugate-mappings","slug":"deep-learning-of-conjugate-mappings","title":"Deep Learning of Conjugate Mappings","date":"2021-04-01","arxiv_id":"2104.01874","repositories_listed":1,"syntology":null},{"url":"/paper/drop-bottleneck-learning-discrete-compressed-1","slug":"drop-bottleneck-learning-discrete-compressed-1","title":"Drop-Bottleneck: Learning Discrete Compressed Representation for Noise-Robust Exploration","date":"2021-03-23","arxiv_id":"2103.12300","repositories_listed":1,"syntology":{"n":6,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 2 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) · 4 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/drop-bottleneck-learning-discrete-compressed-1#ran","syntology_url":"https://syntology.ai/paper/2103.12300","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.12300"}},"official":{"repos":["jaekyeom/drop-bottleneck"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/train-deep-neural-networks-in-40-d-subspaces","slug":"train-deep-neural-networks-in-40-d-subspaces","title":"Low Dimensional Landscape Hypothesis is True: DNNs can be Trained in Tiny Subspaces","date":"2021-03-20","arxiv_id":"2103.11154","repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-of-pooling-layers-for-character","slug":"meta-learning-of-pooling-layers-for-character","title":"Meta-learning of Pooling Layers for Character Recognition","date":"2021-03-17","arxiv_id":"2103.09528","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-whitney-extension-problem-for-near","slug":"on-the-whitney-extension-problem-for-near","title":"On the Whitney near extension problem, BMO, alignment of data, best approximation in algebraic geometry, manifold learning and their beautiful connections: A modern treatment","date":"2021-03-17","arxiv_id":"2103.09748","repositories_listed":1,"syntology":null},{"url":"/paper/r-pointhop-a-green-accurate-and-unsupervised","slug":"r-pointhop-a-green-accurate-and-unsupervised","title":"R-PointHop: A Green, Accurate, and Unsupervised Point Cloud Registration Method","date":"2021-03-15","arxiv_id":"2103.08129","repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-dynamic-convolution-via-matrix-1","slug":"revisiting-dynamic-convolution-via-matrix-1","title":"Revisiting Dynamic Convolution via Matrix Decomposition","date":"2021-03-15","arxiv_id":"2103.08756","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":3,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":6,"phrase":"3 ran (of which 3 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; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/revisiting-dynamic-convolution-via-matrix-1#ran","syntology_url":"https://syntology.ai/paper/2103.08756","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.08756"}},"official":{"repos":["liyunsheng13/dcd"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/defakehop-a-light-weight-high-performance","slug":"defakehop-a-light-weight-high-performance","title":"DefakeHop: A Light-Weight High-Performance Deepfake Detector","date":"2021-03-11","arxiv_id":"2103.06929","repositories_listed":1,"syntology":null},{"url":"/paper/modern-dimension-reduction","slug":"modern-dimension-reduction","title":"Modern Dimension Reduction","date":"2021-03-11","arxiv_id":"2103.06885","repositories_listed":1,"syntology":null},{"url":"/paper/biked-a-dataset-and-machine-learning","slug":"biked-a-dataset-and-machine-learning","title":"BIKED: A Dataset for Computational Bicycle Design with Machine Learning Benchmarks","date":"2021-03-10","arxiv_id":"2103.05844","repositories_listed":1,"syntology":null},{"url":"/paper/explaining-dimensionality-reduction-results","slug":"explaining-dimensionality-reduction-results","title":"Explaining dimensionality reduction results using Shapley values","date":"2021-03-09","arxiv_id":"2103.05678","repositories_listed":1,"syntology":null},{"url":"/paper/simplicial-regularization","slug":"simplicial-regularization","title":"Simplicial Regularization","date":"2021-03-08","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/abstraction-and-symbolic-execution-of-deep","slug":"abstraction-and-symbolic-execution-of-deep","title":"Abstraction and Symbolic Execution of Deep Neural Networks with Bayesian Approximation of Hidden Features","date":"2021-03-05","arxiv_id":"2103.03704","repositories_listed":1,"syntology":null},{"url":"/paper/greedy-search-algorithms-for-unsupervised","slug":"greedy-search-algorithms-for-unsupervised","title":"Lazy FSCA for Unsupervised Variable Selection","date":"2021-03-03","arxiv_id":"2103.02687","repositories_listed":1,"syntology":null},{"url":"/paper/minimum-distortion-embedding","slug":"minimum-distortion-embedding","title":"Minimum-Distortion Embedding","date":"2021-03-03","arxiv_id":"2103.02559","repositories_listed":1,"syntology":null},{"url":"/paper/validating-clustering-frameworks-for-electric","slug":"validating-clustering-frameworks-for-electric","title":"Validating Clustering Frameworks for Electric Load Demand Profiles","date":"2021-02-26","arxiv_id":"2103.00030","repositories_listed":1,"syntology":null},{"url":"/paper/non-linear-sparse-dimensionality-reduction","slug":"non-linear-sparse-dimensionality-reduction","title":"Non-linear, Sparse Dimensionality Reduction via Path Lasso Penalized Autoencoders","date":"2021-02-22","arxiv_id":"2102.10873","repositories_listed":1,"syntology":null},{"url":"/paper/center-smoothing-for-certifiably-robust","slug":"center-smoothing-for-certifiably-robust","title":"Center Smoothing: Certified Robustness for Networks with Structured Outputs","date":"2021-02-19","arxiv_id":"2102.09701","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/center-smoothing-for-certifiably-robust#ran","syntology_url":"https://syntology.ai/paper/2102.09701","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.09701"}},"official":{"repos":["aounon/center-smoothing"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/unsupervised-ground-metric-learning-using","slug":"unsupervised-ground-metric-learning-using","title":"Unsupervised Ground Metric Learning using Wasserstein Singular Vectors","date":"2021-02-11","arxiv_id":"2102.06278","repositories_listed":1,"syntology":null},{"url":"/paper/visualizing-hierarchies-in-scrna-seq-data","slug":"visualizing-hierarchies-in-scrna-seq-data","title":"Visualizing hierarchies in scRNA-seq data using a density tree-biased autoencoder","date":"2021-02-11","arxiv_id":"2102.05892","repositories_listed":1,"syntology":null},{"url":"/paper/rase-a-variable-screening-framework-via","slug":"rase-a-variable-screening-framework-via","title":"RaSE: A Variable Screening Framework via Random Subspace Ensembles","date":"2021-02-07","arxiv_id":"2102.03892","repositories_listed":1,"syntology":null},{"url":"/paper/omiembed-reconstruct-comprehensive-phenotypic","slug":"omiembed-reconstruct-comprehensive-phenotypic","title":"OmiEmbed: a unified multi-task deep learning framework for multi-omics data","date":"2021-02-03","arxiv_id":"2102.02669","repositories_listed":1,"syntology":null},{"url":"/paper/re-explaining-groups-of-points-in-low","slug":"re-explaining-groups-of-points-in-low","title":"[Re] Explaining Groups of Points in Low-Dimensional Representations","date":"2021-01-31","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/fdapy-a-python-package-for-functional-data","slug":"fdapy-a-python-package-for-functional-data","title":"FDApy: a Python package for functional data","date":"2021-01-26","arxiv_id":"2101.11003","repositories_listed":1,"syntology":null},{"url":"/paper/deep-convolutional-autoencoders-for","slug":"deep-convolutional-autoencoders-for","title":"Deep Convolutional Autoencoders for reconstructing magnetic resonance images of the healthy brain","date":"2021-01-19","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/generalized-image-reconstruction-over-t","slug":"generalized-image-reconstruction-over-t","title":"Generalized Image Reconstruction over T-Algebra","date":"2021-01-17","arxiv_id":"2101.06650","repositories_listed":1,"syntology":null},{"url":"/paper/curvature-based-feature-selection-with","slug":"curvature-based-feature-selection-with","title":"Curvature-based Feature Selection with Application in Classifying Electronic Health Records","date":"2021-01-10","arxiv_id":"2101.03581","repositories_listed":1,"syntology":null},{"url":"/paper/a-linearly-convergent-algorithm-for-1","slug":"a-linearly-convergent-algorithm-for-1","title":"A Linearly Convergent Algorithm for Distributed Principal Component Analysis","date":"2021-01-05","arxiv_id":"2101.01300","repositories_listed":1,"syntology":null},{"url":"/paper/aha-adaptive-history-driven-attack-for","slug":"aha-adaptive-history-driven-attack-for","title":"Aha! Adaptive History-Driven Attack for Decision-Based Black-Box Models","date":"2021-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/divergence-regulated-encoder-network-for","slug":"divergence-regulated-encoder-network-for","title":"Divergence Regulated Encoder Network for Joint Dimensionality Reduction and Classification","date":"2020-12-31","arxiv_id":"2012.15764","repositories_listed":1,"syntology":null},{"url":"/paper/a-memory-efficient-baseline-for-open-domain","slug":"a-memory-efficient-baseline-for-open-domain","title":"A Memory Efficient Baseline for Open Domain Question Answering","date":"2020-12-30","arxiv_id":"2012.15156","repositories_listed":1,"syntology":null},{"url":"/paper/manifold-learning-with-arbitrary-norms","slug":"manifold-learning-with-arbitrary-norms","title":"Manifold learning with arbitrary norms","date":"2020-12-28","arxiv_id":"2012.14172","repositories_listed":1,"syntology":null},{"url":"/paper/a-method-to-integrate-and-classify-normals","slug":"a-method-to-integrate-and-classify-normals","title":"A method to integrate and classify normal distributions","date":"2020-12-23","arxiv_id":"2012.14331","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-functional-data-analysis-via","slug":"unsupervised-functional-data-analysis-via","title":"Unsupervised Functional Data Analysis via Nonlinear Dimension Reduction","date":"2020-12-22","arxiv_id":"2012.11987","repositories_listed":1,"syntology":null},{"url":"/paper/2012-11662","slug":"2012-11662","title":"Explicitly Encouraging Low Fractional Dimensional Trajectories Via Reinforcement Learning","date":"2020-12-21","arxiv_id":"2012.11662","repositories_listed":1,"syntology":null},{"url":"/paper/sparse-encoding-for-more-interpretable-1","slug":"sparse-encoding-for-more-interpretable-1","title":"Sparse encoding for more-interpretable feature-selecting representations in probabilistic matrix factorization","date":"2020-12-08","arxiv_id":"2012.04171","repositories_listed":1,"syntology":null},{"url":"/paper/a-journey-in-esn-and-lstm-visualisations-on-a","slug":"a-journey-in-esn-and-lstm-visualisations-on-a","title":"A journey in ESN and LSTM visualisations on a language task","date":"2020-12-03","arxiv_id":"2012.01748","repositories_listed":1,"syntology":null},{"url":"/paper/manifold-learning-and-deep-clustering-with","slug":"manifold-learning-and-deep-clustering-with","title":"K-Deep Simplex: Deep Manifold Learning via Local Dictionaries","date":"2020-12-03","arxiv_id":"2012.02134","repositories_listed":1,"syntology":null},{"url":"/paper/a-convolutional-auto-encoder-for-haplotype","slug":"a-convolutional-auto-encoder-for-haplotype","title":"A Convolutional Auto-Encoder for Haplotype Assembly and Viral Quasispecies Reconstruction","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-feature-sparse-principal-subspace","slug":"learning-feature-sparse-principal-subspace","title":"Learning Feature Sparse Principal Subspace","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-sparse-codes-from-compressed","slug":"learning-sparse-codes-from-compressed","title":"Learning sparse codes from compressed representations with biologically plausible local wiring constraints","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/dimensionality-reduction-regularization-and","slug":"dimensionality-reduction-regularization-and","title":"Dimensionality reduction, regularization, and generalization in overparameterized regressions","date":"2020-11-23","arxiv_id":"2011.11477","repositories_listed":1,"syntology":null},{"url":"/paper/locally-linear-embedding-and-its-variants","slug":"locally-linear-embedding-and-its-variants","title":"Locally Linear Embedding and its Variants: Tutorial and Survey","date":"2020-11-22","arxiv_id":"2011.10925","repositories_listed":1,"syntology":null},{"url":"/paper/interpretable-visualization-and-higher-order","slug":"interpretable-visualization-and-higher-order","title":"Interpretable Visualization and Higher-Order Dimension Reduction for ECoG Data","date":"2020-11-15","arxiv_id":"2011.09447","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-online-learning-of-optimal-rankings","slug":"efficient-online-learning-of-optimal-rankings","title":"Efficient Online Learning of Optimal Rankings: Dimensionality Reduction via Gradient Descent","date":"2020-11-05","arxiv_id":"2011.02817","repositories_listed":1,"syntology":null},{"url":"/paper/deep-generative-lda","slug":"deep-generative-lda","title":"Deep generative LDA","date":"2020-10-30","arxiv_id":"2010.16138","repositories_listed":1,"syntology":null},{"url":"/paper/nested-grassmanns-for-dimensionality","slug":"nested-grassmanns-for-dimensionality","title":"Nested Grassmannians for Dimensionality Reduction with Applications","date":"2020-10-27","arxiv_id":"2010.14589","repositories_listed":1,"syntology":null},{"url":"/paper/geometry-aware-hamiltonian-variational-auto","slug":"geometry-aware-hamiltonian-variational-auto","title":"Geometry-Aware Hamiltonian Variational Auto-Encoder","date":"2020-10-22","arxiv_id":"2010.11518","repositories_listed":1,"syntology":null},{"url":"/paper/a-uniformly-stable-algorithm-for-unsupervised","slug":"a-uniformly-stable-algorithm-for-unsupervised","title":"Algorithmic Stability and Generalization of an Unsupervised Feature Selection Algorithm","date":"2020-10-19","arxiv_id":"2010.09416","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-uniformly-stable-algorithm-for-unsupervised#ran","syntology_url":"https://syntology.ai/paper/2010.09416","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.09416"}},"official":{"repos":["xinxingwu-uk/ufs"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}}],"record_sha256":"47965dc79c88367acfc546a8de1b2ace29603dffcd3f7c6178b025c5a79f7709","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}