{"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/hypothesis-testing/papers/3","list_of":"/task/hypothesis-testing","task":"Two-sample testing","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":3,"pages_in_order":4,"rows_per_page":100,"rows":[201,300],"of":338,"counts":{"archive_papers_tagged":338,"with_a_code_link":84,"where_syntology_ran_a_sample":21,"not_listed_spam_title":0,"listed":338,"listed_where_code_ran":21,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":19,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":19,"listed_every_run_a_failure_of_syntologys_instrument":2,"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/hypothesis-testing","prev":"/task/hypothesis-testing/papers/2","next":"/task/hypothesis-testing/papers/4","papers":[{"url":null,"slug":"computer-vision-and-metrics-learning-for","title":"Computer Vision and Metrics Learning for Hypothesis Testing: An Application of Q-Q Plot for Normality Test","date":"2019-01-23","arxiv_id":"1901.07851","repositories_listed":0,"syntology":null},{"url":null,"slug":"three-principles-of-data-science","title":"Veridical Data Science","date":"2019-01-23","arxiv_id":"1901.08152","repositories_listed":0,"syntology":null},{"url":null,"slug":"instance-based-classification-through","title":"Instance-Based Classification through Hypothesis Testing","date":"2019-01-03","arxiv_id":"1901.00560","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-an-evolvable-cancer-treatment","title":"Towards an Evolvable Cancer Treatment Simulator","date":"2018-12-19","arxiv_id":"1812.08252","repositories_listed":0,"syntology":null},{"url":null,"slug":"sequential-experiment-design-for-hypothesis","title":"Sequential Experiment Design for Hypothesis Verification","date":"2018-12-04","arxiv_id":"1812.01137","repositories_listed":0,"syntology":null},{"url":null,"slug":"testing-for-families-of-distributions-via-the","title":"Testing for Families of Distributions via the Fourier Transform","date":"2018-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"testing-changes-in-communities-for-the","title":"Testing Changes in Communities for the Stochastic Block Model","date":"2018-11-29","arxiv_id":"1812.00769","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-structure-of-optimal-private-tests-for","title":"The Structure of Optimal Private Tests for Simple Hypotheses","date":"2018-11-27","arxiv_id":"1811.11148","repositories_listed":0,"syntology":null},{"url":null,"slug":"minimax-rates-in-network-analysis-graphon","title":"Minimax Rates in Network Analysis: Graphon Estimation, Community Detection and Hypothesis Testing","date":"2018-11-14","arxiv_id":"1811.06055","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-secure-are-deep-learning-algorithms-from","title":"How Secure are Deep Learning Algorithms from Side-Channel based Reverse Engineering?","date":"2018-11-13","arxiv_id":"1811.05259","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-tutorial-on-mdl-hypothesis-testing-for","title":"A tutorial on MDL hypothesis testing for graph analysis","date":"2018-10-31","arxiv_id":"1810.13163","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-simple-way-to-deal-with-cherry-picking","title":"A Simple Way to Deal with Cherry-picking","date":"2018-10-11","arxiv_id":"1810.04996","repositories_listed":0,"syntology":null},{"url":null,"slug":"policy-design-for-active-sequential","title":"Policy Design for Active Sequential Hypothesis Testing using Deep Learning","date":"2018-10-11","arxiv_id":"1810.04859","repositories_listed":0,"syntology":null},{"url":null,"slug":"conditional-word-embedding-and-hypothesis","title":"Conditional Word Embedding and Hypothesis Testing via Bayes-by-Backprop","date":"2018-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"cross-situational-learning-of-large-lexicons","title":"Cross-situational learning of large lexicons with finite memory","date":"2018-09-28","arxiv_id":"1809.11047","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-chernoff-test-optimal-decision","title":"Distributed Chernoff Test: Optimal decision systems over networks","date":"2018-09-12","arxiv_id":"1809.04587","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-level-hypothesis-testing-for","title":"Multi-level hypothesis testing for populations of heterogeneous networks","date":"2018-09-07","arxiv_id":"1809.02512","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-structured-review-of-the-validity-of-bleu","title":"A Structured Review of the Validity of BLEU","date":"2018-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"statistical-windows-in-testing-for-the","title":"Statistical Windows in Testing for the Initial Distribution of a Reversible Markov Chain","date":"2018-08-06","arxiv_id":"1808.01857","repositories_listed":0,"syntology":null},{"url":null,"slug":"optional-stopping-with-bayes-factors-a","title":"Optional Stopping with Bayes Factors: a categorization and extension of folklore results, with an application to invariant situations","date":"2018-07-24","arxiv_id":"1807.09077","repositories_listed":0,"syntology":null},{"url":null,"slug":"differentially-private-false-discovery-rate","title":"Differentially Private False Discovery Rate Control","date":"2018-07-11","arxiv_id":"1807.04209","repositories_listed":0,"syntology":null},{"url":null,"slug":"local-private-hypothesis-testing-chi-square","title":"Local Private Hypothesis Testing: Chi-Square Tests","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"locally-private-hypothesis-testing","title":"Locally Private Hypothesis Testing","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-tuning-for-divide-and-conquer-kernel","title":"Optimal Tuning for Divide-and-conquer Kernel Ridge Regression with Massive Data","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"the-edge-density-barrier-computational","title":"The Edge Density Barrier: Computational-Statistical Tradeoffs in Combinatorial Inference","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"guaranteed-deterministic-bounds-on-the-total","title":"Guaranteed Deterministic Bounds on the Total Variation Distance between Univariate Mixtures","date":"2018-06-29","arxiv_id":"1806.11311","repositories_listed":0,"syntology":null},{"url":null,"slug":"request-and-reverify-hierarchical-hypothesis","title":"Request-and-Reverify: Hierarchical Hypothesis Testing for Concept Drift Detection with Expensive Labels","date":"2018-06-25","arxiv_id":"1806.10131","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-exact-equivalence-of-distance-and-kernel","title":"The Exact Equivalence of Distance and Kernel Methods for Hypothesis Testing","date":"2018-06-14","arxiv_id":"1806.05514","repositories_listed":0,"syntology":null},{"url":null,"slug":"second-order-asymptotically-optimal","title":"Second-Order Asymptotically Optimal Statistical Classification","date":"2018-06-03","arxiv_id":"1806.00739","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-hypothesis-testing-using-wasserstein","title":"Robust Hypothesis Testing Using Wasserstein Uncertainty Sets","date":"2018-05-27","arxiv_id":"1805.10611","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-many-machines-can-we-use-in-parallel","title":"How Many Machines Can We Use in Parallel Computing for Kernel Ridge Regression?","date":"2018-05-25","arxiv_id":"1805.09948","repositories_listed":0,"syntology":null},{"url":null,"slug":"image-derived-generative-modeling-of-pseudo","title":"Image-derived generative modeling of pseudo-macromolecular structures - towards the statistical assessment of Electron CryoTomography template matching","date":"2018-05-12","arxiv_id":"1805.04634","repositories_listed":0,"syntology":null},{"url":null,"slug":"testing-identity-of-multidimensional","title":"Testing Identity of Multidimensional Histograms","date":"2018-04-10","arxiv_id":"1804.03636","repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-textual-grounding-linking-words","title":"Unsupervised Textual Grounding: Linking Words to Image Concepts","date":"2018-03-29","arxiv_id":"1803.11185","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-shannons-channel-to-semantic-channel-via","title":"From Shannon's Channel to Semantic Channel via New Bayes' Formulas for Machine Learning","date":"2018-03-22","arxiv_id":"1803.08979","repositories_listed":0,"syntology":null},{"url":null,"slug":"closing-the-ai-knowledge-gap","title":"Closing the AI Knowledge Gap","date":"2018-03-20","arxiv_id":"1803.07233","repositories_listed":0,"syntology":null},{"url":null,"slug":"resampling-forgery-detection-using-deep","title":"Resampling Forgery Detection Using Deep Learning and A-Contrario Analysis","date":"2018-03-01","arxiv_id":"1803.01711","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalized-binary-search-for-split","title":"Generalized Binary Search For Split-Neighborly Problems","date":"2018-02-27","arxiv_id":"1802.09751","repositories_listed":0,"syntology":null},{"url":null,"slug":"universal-hypothesis-testing-with-kernels","title":"Universal Hypothesis Testing with Kernels: Asymptotically Optimal Tests for Goodness of Fit","date":"2018-02-21","arxiv_id":"1802.07581","repositories_listed":0,"syntology":null},{"url":null,"slug":"dealing-with-uncertainties-in-user-feedback","title":"Dealing with Uncertainties in User Feedback: Strategies Between Denying and Accepting","date":"2018-02-16","arxiv_id":"1802.05895","repositories_listed":0,"syntology":null},{"url":null,"slug":"hypothesis-testing-for-high-dimensional","title":"Hypothesis Testing for High-Dimensional Multinomials: A Selective Review","date":"2017-12-17","arxiv_id":"1712.06120","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-active-hypothesis-testing-under","title":"Adaptive Active Hypothesis Testing under Limited Information","date":"2017-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"discovering-potential-correlations-via","title":"Discovering Potential Correlations via Hypercontractivity","date":"2017-09-12","arxiv_id":"1709.04024","repositories_listed":0,"syntology":null},{"url":null,"slug":"hypothesis-testing-based-intrinsic-evaluation","title":"Hypothesis Testing based Intrinsic Evaluation of Word Embeddings","date":"2017-09-04","arxiv_id":"1709.00831","repositories_listed":0,"syntology":null},{"url":null,"slug":"privit-private-and-sample-efficient-identity-1","title":"Priv’IT: Private and Sample Efficient Identity Testing","date":"2017-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-gaussian-graphical-model-estimation","title":"Robust Gaussian Graphical Model Estimation with Arbitrary Corruption","date":"2017-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"concept-drift-detection-and-adaptation-with","title":"Concept Drift Detection and Adaptation with Hierarchical Hypothesis Testing","date":"2017-07-25","arxiv_id":"1707.07821","repositories_listed":0,"syntology":null},{"url":null,"slug":"two-sample-hypothesis-testing-for","title":"Two-sample Hypothesis Testing for Inhomogeneous Random Graphs","date":"2017-07-04","arxiv_id":"1707.00833","repositories_listed":0,"syntology":null},{"url":null,"slug":"hypothesis-testing-for-densities-and-high","title":"Hypothesis Testing For Densities and High-Dimensional Multinomials: Sharp Local Minimax Rates","date":"2017-06-30","arxiv_id":"1706.10003","repositories_listed":0,"syntology":null},{"url":null,"slug":"kernel-two-sample-hypothesis-testing-using","title":"Kernel Two-Sample Hypothesis Testing Using Kernel Set Classification","date":"2017-06-18","arxiv_id":"1706.05612","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-strong-converse-bound-for-multiple","title":"A strong converse bound for multiple hypothesis testing, with applications to high-dimensional estimation","date":"2017-06-14","arxiv_id":"1706.04410","repositories_listed":0,"syntology":null},{"url":null,"slug":"toward-optimal-run-racing-application-to-deep","title":"Toward Optimal Run Racing: Application to Deep Learning Calibration","date":"2017-06-10","arxiv_id":"1706.03199","repositories_listed":0,"syntology":null},{"url":null,"slug":"two-sample-tests-for-large-random-graphs","title":"Two-Sample Tests for Large Random Graphs Using Network Statistics","date":"2017-05-17","arxiv_id":"1705.06168","repositories_listed":0,"syntology":null},{"url":null,"slug":"negative-results-in-computer-vision-a","title":"Negative Results in Computer Vision: A Perspective","date":"2017-05-11","arxiv_id":"1705.04402","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-flexible-framework-for-hypothesis-testing","title":"A Flexible Framework for Hypothesis Testing in High-dimensions","date":"2017-04-26","arxiv_id":"1704.07971","repositories_listed":0,"syntology":null},{"url":null,"slug":"strictly-proper-kernel-scoring-rules-and","title":"Strictly Proper Kernel Scoring Rules and Divergences with an Application to Kernel Two-Sample Hypothesis Testing","date":"2017-04-09","arxiv_id":"1704.02578","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-benchmarking-of-nlp-apis-using","title":"Efficient Benchmarking of NLP APIs using Multi-armed Bandits","date":"2017-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"testing-and-learning-on-distributions-with","title":"Testing and Learning on Distributions with Symmetric Noise Invariance","date":"2017-03-22","arxiv_id":"1703.07596","repositories_listed":0,"syntology":null},{"url":null,"slug":"measuring-sample-quality-with-kernels","title":"Measuring Sample Quality with Kernels","date":"2017-03-06","arxiv_id":"1703.01717","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-concentration-inequalities-for","title":"Adaptive Concentration Inequalities for Sequential Decision Problems","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"hypothesis-testing-in-unsupervised-domain","title":"Hypothesis Testing in Unsupervised Domain Adaptation with Applications in Alzheimer's Disease","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"reasoning-with-memory-augmented-neural","title":"Reasoning with Memory Augmented Neural Networks for Language Comprehension","date":"2016-10-20","arxiv_id":"1610.06454","repositories_listed":0,"syntology":null},{"url":null,"slug":"two-sample-testing-in-non-sparse-high","title":"Two-sample testing in non-sparse high-dimensional linear models","date":"2016-10-14","arxiv_id":"1610.04580","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-in-implicit-generative-models","title":"Learning in Implicit Generative Models","date":"2016-10-11","arxiv_id":"1610.03483","repositories_listed":0,"syntology":null},{"url":null,"slug":"linear-hypothesis-testing-in-dense-high","title":"Linear Hypothesis Testing in Dense High-Dimensional Linear Models","date":"2016-10-10","arxiv_id":"1610.02987","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-the-design-of-prospect-theory-based","title":"Towards the Design of Prospect-Theory based Human Decision Rules for Hypothesis Testing","date":"2016-10-04","arxiv_id":"1610.01085","repositories_listed":0,"syntology":null},{"url":null,"slug":"information-theoretic-structure-learning-with","title":"Information Theoretic Structure Learning with Confidence","date":"2016-09-13","arxiv_id":"1609.03912","repositories_listed":0,"syntology":null},{"url":null,"slug":"size-consistent-statistics-for-anomaly","title":"Size-Consistent Statistics for Anomaly Detection in Dynamic Networks","date":"2016-08-02","arxiv_id":"1608.00712","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-gaussian-markov-models-for-conditional","title":"A review of Gaussian Markov models for conditional independence","date":"2016-06-23","arxiv_id":"1606.07282","repositories_listed":0,"syntology":null},{"url":null,"slug":"kernel-mean-embedding-of-distributions-a","title":"Kernel Mean Embedding of Distributions: A Review and Beyond","date":"2016-05-31","arxiv_id":"1605.09522","repositories_listed":0,"syntology":null},{"url":null,"slug":"information-recovery-in-shuffled-graphs-via","title":"Information Recovery in Shuffled Graphs via Graph Matching","date":"2016-05-08","arxiv_id":"1605.02315","repositories_listed":0,"syntology":null},{"url":null,"slug":"max-information-differential-privacy-and-post","title":"Max-Information, Differential Privacy, and Post-Selection Hypothesis Testing","date":"2016-04-13","arxiv_id":"1604.03924","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-rules-for-control-of-false-discovery","title":"Online Rules for Control of False Discovery Rate and False Discovery Exceedance","date":"2016-03-29","arxiv_id":"1603.09000","repositories_listed":0,"syntology":null},{"url":null,"slug":"classical-statistics-and-statistical-learning","title":"Classical Statistics and Statistical Learning in Imaging Neuroscience","date":"2016-03-06","arxiv_id":"1603.01857","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-information-theoretic-clustering","title":"Distributed Information-Theoretic Clustering","date":"2016-02-15","arxiv_id":"1602.04605","repositories_listed":0,"syntology":null},{"url":null,"slug":"selective-inference-approach-for","title":"Selective Inference Approach for Statistically Sound Predictive Pattern Mining","date":"2016-02-15","arxiv_id":"1602.04601","repositories_listed":0,"syntology":null},{"url":null,"slug":"toward-optimal-feature-selection-in-naive","title":"Toward Optimal Feature Selection in Naive Bayes for Text Categorization","date":"2016-02-09","arxiv_id":"1602.02850","repositories_listed":0,"syntology":null},{"url":null,"slug":"classification-accuracy-as-a-proxy-for-two","title":"Classification accuracy as a proxy for two sample testing","date":"2016-02-06","arxiv_id":"1602.02210","repositories_listed":0,"syntology":null},{"url":null,"slug":"minimax-lower-bounds-for-linear-independence","title":"Minimax Lower Bounds for Linear Independence Testing","date":"2016-01-23","arxiv_id":"1601.06259","repositories_listed":0,"syntology":null},{"url":null,"slug":"proactive-message-passing-on-memory-factor","title":"Proactive Message Passing on Memory Factor Networks","date":"2016-01-18","arxiv_id":"1601.04667","repositories_listed":0,"syntology":null},{"url":null,"slug":"sharp-computational-statistical-phase","title":"Sharp Computational-Statistical Phase Transitions via Oracle Computational Model","date":"2015-12-30","arxiv_id":"1512.08861","repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-feature-construction-for","title":"Unsupervised Feature Construction for Improving Data Representation and Semantics","date":"2015-12-17","arxiv_id":"1512.05467","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-p-filter-multi-layer-fdr-control-for","title":"The p-filter: multi-layer FDR control for grouped hypotheses","date":"2015-12-10","arxiv_id":"1512.03397","repositories_listed":0,"syntology":null},{"url":null,"slug":"statistical-topological-data-analysis-a","title":"Statistical Topological Data Analysis - A Kernel Perspective","date":"2015-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-hypothesis-testing-for-one-bit","title":"Bayesian hypothesis testing for one bit compressed sensing with sensing matrix perturbation","date":"2015-11-18","arxiv_id":"1511.05660","repositories_listed":0,"syntology":null},{"url":null,"slug":"private-false-discovery-rate-control","title":"Private False Discovery Rate Control","date":"2015-11-12","arxiv_id":"1511.03803","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-sparse-linear-model-and-significance-test","title":"A Sparse Linear Model and Significance Test for Individual Consumption Prediction","date":"2015-11-05","arxiv_id":"1511.01853","repositories_listed":0,"syntology":null},{"url":null,"slug":"rapid-online-analysis-of-local-feature","title":"Rapid Online Analysis of Local Feature Detectors and Their Complementarity","date":"2015-10-17","arxiv_id":"1510.05145","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-to-formulate-and-solve-statistical","title":"How to Formulate and Solve Statistical Recognition and Learning Problems","date":"2015-09-29","arxiv_id":"1509.08830","repositories_listed":0,"syntology":null},{"url":null,"slug":"markov-boundary-discovery-with-ridge","title":"Markov Boundary Discovery with Ridge Regularized Linear Models","date":"2015-09-14","arxiv_id":"1509.03935","repositories_listed":0,"syntology":null},{"url":null,"slug":"iterative-hypothesis-testing-for-multi-object","title":"Iterative hypothesis testing for multi-object tracking in presence of features with variable reliability","date":"2015-09-01","arxiv_id":"1509.00313","repositories_listed":0,"syntology":null},{"url":null,"slug":"wald-kernel-learning-to-aggregate-information","title":"Wald-Kernel: Learning to Aggregate Information for Sequential Inference","date":"2015-08-31","arxiv_id":"1508.07964","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-hypothesis-testing-for-block-sparse","title":"Bayesian Hypothesis Testing for Block Sparse Signal Recovery","date":"2015-08-22","arxiv_id":"1508.05495","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptivity-and-computation-statistics","title":"Adaptivity and Computation-Statistics Tradeoffs for Kernel and Distance based High Dimensional Two Sample Testing","date":"2015-08-04","arxiv_id":"1508.00655","repositories_listed":0,"syntology":null},{"url":null,"slug":"equitability-interval-estimation-and","title":"Equitability, interval estimation, and statistical power","date":"2015-05-09","arxiv_id":"1505.02212","repositories_listed":0,"syntology":null},{"url":null,"slug":"local-variation-as-a-statistical-hypothesis","title":"Local Variation as a Statistical Hypothesis Test","date":"2015-04-24","arxiv_id":"1504.06507","repositories_listed":0,"syntology":null},{"url":null,"slug":"phase-transitions-for-high-dimensional","title":"Phase Transitions for High Dimensional Clustering and Related Problems","date":"2015-02-24","arxiv_id":"1502.06952","repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-sum-of-squares-lower-bounds-for","title":"Improved Sum-of-Squares Lower Bounds for Hidden Clique and Hidden Submatrix Problems","date":"2015-02-23","arxiv_id":"1502.06590","repositories_listed":0,"syntology":null},{"url":null,"slug":"detection-of-planted-solutions-for-flat","title":"Detection of Planted Solutions for Flat Satisfiability Problems","date":"2015-02-21","arxiv_id":"1502.06144","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-and-memory-efficient-significant-pattern","title":"Fast and Memory-Efficient Significant Pattern Mining via Permutation Testing","date":"2015-02-15","arxiv_id":"1502.04315","repositories_listed":0,"syntology":null}],"record_sha256":"13ed49e9888b369266daaf0d02ca1cfa14e75c9613446f50f0a4f1e0c1fd4a6e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}