{"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/density-estimation/papers/5","list_of":"/task/density-estimation","task":"Density Estimation","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":5,"pages_in_order":14,"rows_per_page":100,"rows":[401,500],"of":1394,"counts":{"archive_papers_tagged":1394,"with_a_code_link":498,"where_syntology_ran_a_sample":140,"not_listed_spam_title":0,"listed":1394,"listed_where_code_ran":140,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":118,"every_run_a_failure_of_syntologys_instrument":22,"listed_with_a_run_with_no_instrument_failure":118,"listed_every_run_a_failure_of_syntologys_instrument":22,"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/density-estimation","prev":"/task/density-estimation/papers/4","next":"/task/density-estimation/papers/6","papers":[{"url":"/paper/interpolated-adjoint-method-for-neural-odes","slug":"interpolated-adjoint-method-for-neural-odes","title":"Interpolation Technique to Speed Up Gradients Propagation in Neural ODEs","date":"2020-03-11","arxiv_id":"2003.05271","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/interpolated-adjoint-method-for-neural-odes#ran","syntology_url":"https://syntology.ai/paper/2003.05271","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.05271"}},"official":null}},{"url":"/paper/noise-estimation-using-density-estimation-for","slug":"noise-estimation-using-density-estimation-for","title":"Noise Estimation Using Density Estimation for Self-Supervised Multimodal Learning","date":"2020-03-06","arxiv_id":"2003.03186","repositories_listed":1,"syntology":null},{"url":"/paper/gradient-boosted-flows","slug":"gradient-boosted-flows","title":"Gradient Boosted Normalizing Flows","date":"2020-02-27","arxiv_id":"2002.11896","repositories_listed":1,"syntology":{"n":30,"n_ran":20,"n_constructed":0,"n_ran_checked":17,"n_instrument":3,"n_unverified":10,"n_honours":0,"n_violates":0,"n_no_contract":17,"n_pointer_only":0,"phrase":"20 ran (of which 0 constructed an object rather than computing a result; 17 with no instrument failure: 0 honoured, 0 violated, 17 with no contract checked; 3 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/gradient-boosted-flows#ran","syntology_url":"https://syntology.ai/paper/2002.11896","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.11896"}},"official":{"repos":["robert-giaquinto/gradient-boosted-normalizing-flows"],"state":"official (archive's flag): 20 ran","n_ran":20,"n_constructed":0,"n_ran_no_instrument_failure":17,"n_unverified":10,"ran_from_kinds":["official"]}}},{"url":"/paper/modeling-continuous-stochastic-processes-with","slug":"modeling-continuous-stochastic-processes-with","title":"Modeling Continuous Stochastic Processes with Dynamic Normalizing Flows","date":"2020-02-24","arxiv_id":"2002.10516","repositories_listed":1,"syntology":null},{"url":"/paper/vflow-more-expressive-generative-flows-with","slug":"vflow-more-expressive-generative-flows-with","title":"VFlow: More Expressive Generative Flows with Variational Data Augmentation","date":"2020-02-22","arxiv_id":"2002.09741","repositories_listed":1,"syntology":{"n":9,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/vflow-more-expressive-generative-flows-with#ran","syntology_url":"https://syntology.ai/paper/2002.09741","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.09741"}},"official":{"repos":["thu-ml/vflow"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/a-unified-framework-for-gaussian-mixture","slug":"a-unified-framework-for-gaussian-mixture","title":"Gaussian Mixture Reduction with Composite Transportation Divergence","date":"2020-02-19","arxiv_id":"2002.08410","repositories_listed":1,"syntology":null},{"url":"/paper/schoenberg-rao-distances-entropy-based-and","slug":"schoenberg-rao-distances-entropy-based-and","title":"Schoenberg-Rao distances: Entropy-based and geometry-aware statistical Hilbert distances","date":"2020-02-19","arxiv_id":"2002.08345","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-discrepancy-between-density-estimation","slug":"on-the-discrepancy-between-density-estimation","title":"On the Discrepancy between Density Estimation and Sequence Generation","date":"2020-02-17","arxiv_id":"2002.07233","repositories_listed":1,"syntology":null},{"url":"/paper/latent-variable-modelling-with-hyperbolic","slug":"latent-variable-modelling-with-hyperbolic","title":"Latent Variable Modelling with Hyperbolic Normalizing Flows","date":"2020-02-15","arxiv_id":"2002.06336","repositories_listed":1,"syntology":null},{"url":"/paper/universal-value-density-estimation-for","slug":"universal-value-density-estimation-for","title":"Universal Value Density Estimation for Imitation Learning and Goal-Conditioned Reinforcement Learning","date":"2020-02-15","arxiv_id":"2002.06473","repositories_listed":1,"syntology":null},{"url":"/paper/graphaf-a-flow-based-autoregressive-model-for-1","slug":"graphaf-a-flow-based-autoregressive-model-for-1","title":"GraphAF: a Flow-based Autoregressive Model for Molecular Graph Generation","date":"2020-01-26","arxiv_id":"2001.09382","repositories_listed":1,"syntology":null},{"url":"/paper/expected-information-maximization-using-the-i-1","slug":"expected-information-maximization-using-the-i-1","title":"Expected Information Maximization: Using the I-Projection for Mixture Density Estimation","date":"2020-01-23","arxiv_id":"2001.08682","repositories_listed":1,"syntology":null},{"url":"/paper/anomaly-detection-with-density-estimation","slug":"anomaly-detection-with-density-estimation","title":"Anomaly Detection with Density Estimation","date":"2020-01-14","arxiv_id":"2001.04990","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":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/anomaly-detection-with-density-estimation#ran","syntology_url":"https://syntology.ai/paper/2001.04990","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.04990"}},"official":null}},{"url":"/paper/a-nonparametric-offpolicy-policy-gradient","slug":"a-nonparametric-offpolicy-policy-gradient","title":"A Nonparametric Off-Policy Policy Gradient","date":"2020-01-08","arxiv_id":"2001.02435","repositories_listed":1,"syntology":null},{"url":"/paper/apricot-a-dataset-of-physical-adversarial","slug":"apricot-a-dataset-of-physical-adversarial","title":"APRICOT: A Dataset of Physical Adversarial Attacks on Object Detection","date":"2019-12-17","arxiv_id":"1912.08166","repositories_listed":1,"syntology":null},{"url":"/paper/hcnaf-hyper-conditioned-neural-autoregressive","slug":"hcnaf-hyper-conditioned-neural-autoregressive","title":"HCNAF: Hyper-Conditioned Neural Autoregressive Flow and its Application for Probabilistic Occupancy Map Forecasting","date":"2019-12-17","arxiv_id":"1912.08111","repositories_listed":1,"syntology":null},{"url":"/paper/multivariate-triangular-quantile-maps-for","slug":"multivariate-triangular-quantile-maps-for","title":"Multivariate Triangular Quantile Maps for Novelty Detection","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/on-fenchel-mini-max-learning","slug":"on-fenchel-mini-max-learning","title":"On Fenchel Mini-Max Learning","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/space-and-time-efficient-kernel-density","slug":"space-and-time-efficient-kernel-density","title":"Space and Time Efficient Kernel Density Estimation in High Dimensions","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-optimize-variational-quantum","slug":"learning-to-optimize-variational-quantum","title":"Learning to Optimize Variational Quantum Circuits to Solve Combinatorial Problems","date":"2019-11-25","arxiv_id":"1911.11071","repositories_listed":1,"syntology":null},{"url":"/paper/nested-conformal-prediction-and-the","slug":"nested-conformal-prediction-and-the","title":"Nested conformal prediction and quantile out-of-bag ensemble methods","date":"2019-10-23","arxiv_id":"1910.10562","repositories_listed":1,"syntology":null},{"url":"/paper/variationally-inferred-sampling-through-a-1","slug":"variationally-inferred-sampling-through-a-1","title":"Variationally Inferred Sampling Through a Refined Bound","date":"2019-10-16","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/neural-canonical-transformation-with","slug":"neural-canonical-transformation-with","title":"Neural Canonical Transformation with Symplectic Flows","date":"2019-09-30","arxiv_id":"1910.00024","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/neural-canonical-transformation-with#ran","syntology_url":"https://syntology.ai/paper/1910.00024","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.00024"}},"official":{"repos":["li012589/neuralCT"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/autogmm-automatic-gaussian-mixture-modeling","slug":"autogmm-automatic-gaussian-mixture-modeling","title":"AutoGMM: Automatic and Hierarchical Gaussian Mixture Modeling in Python","date":"2019-09-06","arxiv_id":"1909.02688","repositories_listed":1,"syntology":null},{"url":"/paper/variationally-inferred-sampling-through-a","slug":"variationally-inferred-sampling-through-a","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","date":"2019-08-26","arxiv_id":"1908.09744","repositories_listed":1,"syntology":null},{"url":"/paper/noise-regularization-for-conditional-density","slug":"noise-regularization-for-conditional-density","title":"Noise Regularization for Conditional Density Estimation","date":"2019-07-21","arxiv_id":"1907.08982","repositories_listed":1,"syntology":null},{"url":"/paper/minimizers-of-the-empirical-risk-and-risk","slug":"minimizers-of-the-empirical-risk-and-risk","title":"Minimizers of the Empirical Risk and Risk Monotonicity","date":"2019-07-11","arxiv_id":"1907.05476","repositories_listed":1,"syntology":null},{"url":"/paper/reweighted-expectation-maximization","slug":"reweighted-expectation-maximization","title":"Reweighted Expectation Maximization","date":"2019-06-13","arxiv_id":"1906.05850","repositories_listed":1,"syntology":null},{"url":"/paper/reconstruction-and-membership-inference","slug":"reconstruction-and-membership-inference","title":"Reconstruction and Membership Inference Attacks against Generative Models","date":"2019-06-07","arxiv_id":"1906.03006","repositories_listed":1,"syntology":null},{"url":"/paper/estimating-feature-label-dependence-using","slug":"estimating-feature-label-dependence-using","title":"Estimating Feature-Label Dependence Using Gini Distance Statistics","date":"2019-06-05","arxiv_id":"1906.02171","repositories_listed":1,"syntology":null},{"url":"/paper/190600311","slug":"190600311","title":"Smoothing Structured Decomposable Circuits","date":"2019-06-01","arxiv_id":"1906.00311","repositories_listed":1,"syntology":null},{"url":"/paper/bivariate-beta-lstm","slug":"bivariate-beta-lstm","title":"Bivariate Beta-LSTM","date":"2019-05-25","arxiv_id":"1905.10521","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":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/bivariate-beta-lstm#ran","syntology_url":"https://syntology.ai/paper/1905.10521","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10521"}},"official":{"repos":["gtshs2/BetaLSTM"],"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/hint-hierarchical-invertible-neural-transport","slug":"hint-hierarchical-invertible-neural-transport","title":"HINT: Hierarchical Invertible Neural Transport for Density Estimation and Bayesian Inference","date":"2019-05-25","arxiv_id":"1905.10687","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/hint-hierarchical-invertible-neural-transport#ran","syntology_url":"https://syntology.ai/paper/1905.10687","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10687"}},"official":{"repos":["VLL-HD/HINT"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/dirac-delta-regression-conditional-density","slug":"dirac-delta-regression-conditional-density","title":"Dirac Delta Regression: Conditional Density Estimation with Clinical Trials","date":"2019-05-24","arxiv_id":"1905.10330","repositories_listed":1,"syntology":null},{"url":"/paper/selectivity-estimation-with-deep-likelihood","slug":"selectivity-estimation-with-deep-likelihood","title":"Deep Unsupervised Cardinality Estimation","date":"2019-05-10","arxiv_id":"1905.04278","repositories_listed":1,"syntology":null},{"url":"/paper/generative-model-with-dynamic-linear-flow","slug":"generative-model-with-dynamic-linear-flow","title":"Generative Model with Dynamic Linear Flow","date":"2019-05-08","arxiv_id":"1905.03239","repositories_listed":1,"syntology":null},{"url":"/paper/detecting-adversarial-examples-through","slug":"detecting-adversarial-examples-through","title":"Detecting Adversarial Examples through Nonlinear Dimensionality Reduction","date":"2019-04-30","arxiv_id":"1904.13094","repositories_listed":1,"syntology":null},{"url":"/paper/autoregressive-energy-machines","slug":"autoregressive-energy-machines","title":"Autoregressive Energy Machines","date":"2019-04-11","arxiv_id":"1904.05626","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":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/autoregressive-energy-machines#ran","syntology_url":"https://syntology.ai/paper/1904.05626","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.05626"}},"official":{"repos":["conormdurkan/autoregressive-energy-machines"],"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/counting-with-focus-for-free","slug":"counting-with-focus-for-free","title":"Counting with Focus for Free","date":"2019-03-28","arxiv_id":"1903.12206","repositories_listed":1,"syntology":null},{"url":"/paper/conditional-density-estimation-with-neural","slug":"conditional-density-estimation-with-neural","title":"Conditional Density Estimation with Neural Networks: Best Practices and Benchmarks","date":"2019-03-03","arxiv_id":"1903.00954","repositories_listed":1,"syntology":null},{"url":"/paper/dedpul-method-for-mixture-proportion","slug":"dedpul-method-for-mixture-proportion","title":"DEDPUL: Difference-of-Estimated-Densities-based Positive-Unlabeled Learning","date":"2019-02-19","arxiv_id":"1902.06965","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/dedpul-method-for-mixture-proportion#ran","syntology_url":"https://syntology.ai/paper/1902.06965","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.06965"}},"official":{"repos":["dimonenka/DEDPUL"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/meta-amortized-variational-inference-and","slug":"meta-amortized-variational-inference-and","title":"Meta-Amortized Variational Inference and Learning","date":"2019-02-05","arxiv_id":"1902.01950","repositories_listed":1,"syntology":{"n":15,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":1,"n_no_contract":8,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 1 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/meta-amortized-variational-inference-and#ran","syntology_url":"https://syntology.ai/paper/1902.01950","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.01950"}},"official":null}},{"url":"/paper/permutation-invariant-likelihoods-and","slug":"permutation-invariant-likelihoods-and","title":"Exchangeable Generative Models with Flow Scans","date":"2019-02-05","arxiv_id":"1902.01967","repositories_listed":1,"syntology":null},{"url":"/paper/re-examination-of-the-role-of-latent","slug":"re-examination-of-the-role-of-latent","title":"Re-examination of the Role of Latent Variables in Sequence Modeling","date":"2019-02-04","arxiv_id":"1902.01388","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":1,"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/re-examination-of-the-role-of-latent#ran","syntology_url":"https://syntology.ai/paper/1902.01388","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.01388"}},"official":{"repos":["zihangdai/reexamine-srnn"],"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/dynamic-feature-acquisition-using-denoising","slug":"dynamic-feature-acquisition-using-denoising","title":"Dynamic Feature Acquisition Using Denoising Autoencoders","date":"2018-11-03","arxiv_id":"1811.01249","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/dynamic-feature-acquisition-using-denoising#ran","syntology_url":"https://syntology.ai/paper/1811.01249","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.01249"}},"official":null}},{"url":"/paper/monge-ampere-flow-for-generative-modeling","slug":"monge-ampere-flow-for-generative-modeling","title":"Monge-Ampère Flow for Generative Modeling","date":"2018-09-26","arxiv_id":"1809.10188","repositories_listed":1,"syntology":null},{"url":"/paper/variational-autoencoder-with-implicit-optimal","slug":"variational-autoencoder-with-implicit-optimal","title":"Variational Autoencoder with Implicit Optimal Priors","date":"2018-09-14","arxiv_id":"1809.05284","repositories_listed":1,"syntology":null},{"url":"/paper/stacked-pooling-improving-crowd-counting-by","slug":"stacked-pooling-improving-crowd-counting-by","title":"Stacked Pooling: Improving Crowd Counting by Boosting Scale Invariance","date":"2018-08-22","arxiv_id":"1808.07456","repositories_listed":1,"syntology":null},{"url":"/paper/nonparametric-gaussian-mixture-models-for-the","slug":"nonparametric-gaussian-mixture-models-for-the","title":"Nonparametric Gaussian Mixture Models for the Multi-Armed Bandit","date":"2018-08-08","arxiv_id":"1808.02932","repositories_listed":1,"syntology":null},{"url":"/paper/deep-density-destructors","slug":"deep-density-destructors","title":"Deep Density Destructors","date":"2018-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/integral-privacy-for-sampling-from-mollifier","slug":"integral-privacy-for-sampling-from-mollifier","title":"Integral Privacy for Sampling","date":"2018-06-13","arxiv_id":"1806.04819","repositories_listed":1,"syntology":null},{"url":"/paper/regularization-by-denoising-clarifications","slug":"regularization-by-denoising-clarifications","title":"Regularization by Denoising: Clarifications and New Interpretations","date":"2018-06-06","arxiv_id":"1806.02296","repositories_listed":1,"syntology":null},{"url":"/paper/crowd-counting-via-adversarial-cross-scale","slug":"crowd-counting-via-adversarial-cross-scale","title":"Crowd Counting via Adversarial Cross-Scale Consistency Pursuit","date":"2018-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/deep-energy-estimator-networks","slug":"deep-energy-estimator-networks","title":"Deep Energy Estimator Networks","date":"2018-05-21","arxiv_id":"1805.08306","repositories_listed":1,"syntology":null},{"url":"/paper/abc-cde-towards-approximate-bayesian","slug":"abc-cde-towards-approximate-bayesian","title":"ABC-CDE: Towards Approximate Bayesian Computation with Complex High-Dimensional Data and Limited Simulations","date":"2018-05-14","arxiv_id":"1805.05480","repositories_listed":1,"syntology":null},{"url":"/paper/graphite-iterative-generative-modeling-of","slug":"graphite-iterative-generative-modeling-of","title":"Graphite: Iterative Generative Modeling of Graphs","date":"2018-03-28","arxiv_id":"1803.10459","repositories_listed":1,"syntology":null},{"url":"/paper/density-aware-single-image-de-raining-using-a","slug":"density-aware-single-image-de-raining-using-a","title":"Density-aware Single Image De-raining using a Multi-stream Dense Network","date":"2018-02-21","arxiv_id":"1802.07412","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-high-resolution-forecasting-of","slug":"scalable-high-resolution-forecasting-of","title":"Scalable high-resolution forecasting of sparse spatiotemporal events with kernel methods: a winning solution to the NIJ \"Real-Time Crime Forecasting Challenge\"","date":"2018-01-09","arxiv_id":"1801.02858","repositories_listed":1,"syntology":null},{"url":"/paper/phoenics-a-universal-deep-bayesian-optimizer","slug":"phoenics-a-universal-deep-bayesian-optimizer","title":"PHOENICS: A universal deep Bayesian optimizer","date":"2018-01-04","arxiv_id":"1801.01469","repositories_listed":1,"syntology":null},{"url":"/paper/decidenet-counting-varying-density-crowds","slug":"decidenet-counting-varying-density-crowds","title":"DecideNet: Counting Varying Density Crowds Through Attention Guided Detection and Density Estimation","date":"2017-12-18","arxiv_id":"1712.06679","repositories_listed":1,"syntology":null},{"url":"/paper/asymmetric-variational-autoencoders","slug":"asymmetric-variational-autoencoders","title":"Asymmetric Variational Autoencoders","date":"2017-11-20","arxiv_id":"1711.08352","repositories_listed":1,"syntology":null},{"url":"/paper/sum-product-graphical-models","slug":"sum-product-graphical-models","title":"Sum-Product Graphical Models","date":"2017-08-21","arxiv_id":"1708.06438","repositories_listed":1,"syntology":null},{"url":"/paper/cnn-based-cascaded-multi-task-learning-of","slug":"cnn-based-cascaded-multi-task-learning-of","title":"CNN-based Cascaded Multi-task Learning of High-level Prior and Density Estimation for Crowd Counting","date":"2017-07-30","arxiv_id":"1707.09605","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-of-recent-advances-in-cnn-based","slug":"a-survey-of-recent-advances-in-cnn-based","title":"A Survey of Recent Advances in CNN-based Single Image Crowd Counting and Density Estimation","date":"2017-07-05","arxiv_id":"1707.01202","repositories_listed":1,"syntology":null},{"url":"/paper/an-alternative-to-em-for-gaussian-mixture","slug":"an-alternative-to-em-for-gaussian-mixture","title":"An Alternative to EM for Gaussian Mixture Models: Batch and Stochastic Riemannian Optimization","date":"2017-06-10","arxiv_id":"1706.03267","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-counting-comparisons-of-density-maps","slug":"beyond-counting-comparisons-of-density-maps","title":"Beyond Counting: Comparisons of Density Maps for Crowd Analysis Tasks - Counting, Detection, and Tracking","date":"2017-05-29","arxiv_id":"1705.10118","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-and-principled-score-estimation","slug":"efficient-and-principled-score-estimation","title":"Efficient and principled score estimation with Nyström kernel exponential families","date":"2017-05-23","arxiv_id":"1705.08360","repositories_listed":1,"syntology":null},{"url":"/paper/the-kernel-mixture-network-a-nonparametric","slug":"the-kernel-mixture-network-a-nonparametric","title":"The Kernel Mixture Network: A Nonparametric Method for Conditional Density Estimation of Continuous Random Variables","date":"2017-05-19","arxiv_id":"1705.07111","repositories_listed":1,"syntology":null},{"url":"/paper/converting-high-dimensional-regression-to","slug":"converting-high-dimensional-regression-to","title":"Converting High-Dimensional Regression to High-Dimensional Conditional Density Estimation","date":"2017-04-26","arxiv_id":"1704.08095","repositories_listed":1,"syntology":null},{"url":"/paper/ex2-exploration-with-exemplar-models-for-deep","slug":"ex2-exploration-with-exemplar-models-for-deep","title":"EX2: Exploration with Exemplar Models for Deep Reinforcement Learning","date":"2017-03-03","arxiv_id":"1703.01260","repositories_listed":1,"syntology":null},{"url":"/paper/boosted-generative-models","slug":"boosted-generative-models","title":"Boosted Generative Models","date":"2017-02-27","arxiv_id":"1702.08484","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/boosted-generative-models#ran","syntology_url":"https://syntology.ai/paper/1702.08484","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1702.08484"}},"official":{"repos":["ermongroup/bgm"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/bayesian-methods-for-solving-estimation-and","slug":"bayesian-methods-for-solving-estimation-and","title":"Bayesian methods for solving estimation and forecasting problems in the high-frequency trading environment","date":"2016-12-16","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/fast-free-inference-of-simulation-models-with-1","slug":"fast-free-inference-of-simulation-models-with-1","title":"Fast ε-free Inference of Simulation Models with Bayesian Conditional Density Estimation","date":"2016-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/bottleneck-conditional-density-estimation","slug":"bottleneck-conditional-density-estimation","title":"Bottleneck Conditional Density Estimation","date":"2016-11-25","arxiv_id":"1611.08568","repositories_listed":1,"syntology":null},{"url":"/paper/multiplicative-lstm-for-sequence-modelling","slug":"multiplicative-lstm-for-sequence-modelling","title":"Multiplicative LSTM for sequence modelling","date":"2016-09-26","arxiv_id":"1609.07959","repositories_listed":1,"syntology":null},{"url":"/paper/learning-hmms-with-nonparametric-emissions","slug":"learning-hmms-with-nonparametric-emissions","title":"Learning HMMs with Nonparametric Emissions via Spectral Decompositions of Continuous Matrices","date":"2016-09-21","arxiv_id":"1609.06390","repositories_listed":1,"syntology":null},{"url":"/paper/fast-free-inference-of-simulation-models-with","slug":"fast-free-inference-of-simulation-models-with","title":"Fast $ε$-free Inference of Simulation Models with Bayesian Conditional Density Estimation","date":"2016-05-20","arxiv_id":"1605.06376","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-generate-with-memory","slug":"learning-to-generate-with-memory","title":"Learning to Generate with Memory","date":"2016-02-24","arxiv_id":"1602.07416","repositories_listed":1,"syntology":null},{"url":"/paper/a-kernel-test-of-goodness-of-fit","slug":"a-kernel-test-of-goodness-of-fit","title":"A Kernel Test of Goodness of Fit","date":"2016-02-09","arxiv_id":"1602.02964","repositories_listed":1,"syntology":{"n":9,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/a-kernel-test-of-goodness-of-fit#ran","syntology_url":"https://syntology.ai/paper/1602.02964","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1602.02964"}},"official":{"repos":["karlnapf/kernel_goodness_of_fit"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/nonparametric-semi-supervised-learning-of","slug":"nonparametric-semi-supervised-learning-of","title":"Nonparametric semi-supervised learning of class proportions","date":"2016-01-08","arxiv_id":"1601.01944","repositories_listed":1,"syntology":null},{"url":"/paper/cascaded-high-dimensional-histograms-a","slug":"cascaded-high-dimensional-histograms-a","title":"Sparse Density Trees and Lists: An Interpretable Alternative to High-Dimensional Histograms","date":"2015-10-22","arxiv_id":"1510.06779","repositories_listed":1,"syntology":null},{"url":"/paper/towards-universal-neural-nets-gibbs-machines","slug":"towards-universal-neural-nets-gibbs-machines","title":"Towards universal neural nets: Gibbs machines and ACE","date":"2015-08-26","arxiv_id":"1508.06585","repositories_listed":1,"syntology":null},{"url":"/paper/a-pca-based-change-detection-framework-for","slug":"a-pca-based-change-detection-framework-for","title":"A PCA-Based Change Detection Framework for Multidimensional Data Streams: Change Detection in Multidimensional Data Streams","date":"2015-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/mixest-an-estimation-toolbox-for-mixture","slug":"mixest-an-estimation-toolbox-for-mixture","title":"MixEst: An Estimation Toolbox for Mixture Models","date":"2015-07-22","arxiv_id":"1507.06065","repositories_listed":1,"syntology":null},{"url":"/paper/statistical-inference-using-the-morse-smale","slug":"statistical-inference-using-the-morse-smale","title":"Statistical Inference using the Morse-Smale Complex","date":"2015-06-29","arxiv_id":"1506.08826","repositories_listed":1,"syntology":null},{"url":"/paper/iterative-neural-autoregressive-distribution","slug":"iterative-neural-autoregressive-distribution","title":"Iterative Neural Autoregressive Distribution Estimator NADE-k","date":"2014-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/the-infinite-mixture-of-infinite-gaussian","slug":"the-infinite-mixture-of-infinite-gaussian","title":"The Infinite Mixture of Infinite Gaussian Mixtures","date":"2014-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/unification-of-field-theory-and-maximum","slug":"unification-of-field-theory-and-maximum","title":"Unification of field theory and maximum entropy methods for learning probability densities","date":"2014-11-19","arxiv_id":"1411.5371","repositories_listed":1,"syntology":null},{"url":"/paper/learning-theory-for-distribution-regression","slug":"learning-theory-for-distribution-regression","title":"Learning Theory for Distribution Regression","date":"2014-11-08","arxiv_id":"1411.2066","repositories_listed":1,"syntology":null},{"url":"/paper/warped-mixtures-for-nonparametric-cluster","slug":"warped-mixtures-for-nonparametric-cluster","title":"Warped Mixtures for Nonparametric Cluster Shapes","date":"2014-08-09","arxiv_id":"1408.2061","repositories_listed":1,"syntology":null},{"url":"/paper/empirical-non-parametric-estimation-of-the","slug":"empirical-non-parametric-estimation-of-the","title":"Empirical non-parametric estimation of the Fisher Information","date":"2014-08-06","arxiv_id":"1408.1182","repositories_listed":1,"syntology":null},{"url":"/paper/iterative-neural-autoregressive-distribution-1","slug":"iterative-neural-autoregressive-distribution-1","title":"Iterative Neural Autoregressive Distribution Estimator (NADE-k)","date":"2014-06-05","arxiv_id":"1406.1485","repositories_listed":1,"syntology":null},{"url":"/paper/density-estimation-in-infinite-dimensional","slug":"density-estimation-in-infinite-dimensional","title":"Density Estimation in Infinite Dimensional Exponential Families","date":"2013-12-12","arxiv_id":"1312.3516","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-prune-in-metric-and-non-metric","slug":"learning-to-prune-in-metric-and-non-metric","title":"Learning to Prune in Metric and Non-Metric Spaces","date":"2013-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-deep-and-tractable-density-estimator","slug":"a-deep-and-tractable-density-estimator","title":"A Deep and Tractable Density Estimator","date":"2013-10-07","arxiv_id":"1310.1757","repositories_listed":1,"syntology":null},{"url":"/paper/laplace-approximation-for-logistic-gaussian","slug":"laplace-approximation-for-logistic-gaussian","title":"Laplace approximation for logistic Gaussian process density estimation and regression","date":"2012-11-01","arxiv_id":"1211.0174","repositories_listed":1,"syntology":null},{"url":"/paper/fast-nonparametric-conditional-density","slug":"fast-nonparametric-conditional-density","title":"Fast Nonparametric Conditional Density Estimation","date":"2012-06-20","arxiv_id":"1206.5278","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/fast-nonparametric-conditional-density#ran","syntology_url":"https://syntology.ai/paper/1206.5278","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1206.5278"}},"official":null}},{"url":"/paper/warped-mixtures-for-nonparametric-cluster-1","slug":"warped-mixtures-for-nonparametric-cluster-1","title":"Warped Mixtures for Nonparametric Cluster Shapes","date":"2012-06-08","arxiv_id":"1206.1846","repositories_listed":1,"syntology":null},{"url":null,"slug":"missing-value-imputation-with-adversarial","title":"Missing value imputation with adversarial random forests -- MissARF","date":"2025-07-21","arxiv_id":"2507.15681","repositories_listed":0,"syntology":null},{"url":null,"slug":"3c-fbi-a-combinatorial-method-using","title":"3C-FBI: A Combinatorial method using Convolutions for Circle Fitting in Blurry Images","date":"2025-07-15","arxiv_id":"2507.11476","repositories_listed":0,"syntology":null}],"record_sha256":"a3ef09d01e38110a24b3735e22ae2306c9b2bbd33dfd2b216c160053b2892443","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}