{"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/point-processes/papers/2","list_of":"/task/point-processes","task":"Point Processes","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":2,"pages_in_order":6,"rows_per_page":100,"rows":[101,200],"of":541,"counts":{"archive_papers_tagged":541,"with_a_code_link":164,"where_syntology_ran_a_sample":40,"not_listed_spam_title":0,"listed":541,"listed_where_code_ran":40,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":38,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":38,"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/point-processes","prev":"/task/point-processes","next":"/task/point-processes/papers/3","papers":[{"url":"/paper/how-certain-is-your-transformer","slug":"how-certain-is-your-transformer","title":"How Certain is Your Transformer?","date":"2021-04-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/batch-bayesian-optimization-on-permutations","slug":"batch-bayesian-optimization-on-permutations","title":"Batch Bayesian Optimization on Permutations using the Acquisition Weighted Kernel","date":"2021-02-26","arxiv_id":"2102.13382","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/batch-bayesian-optimization-on-permutations#ran","syntology_url":"https://syntology.ai/paper/2102.13382","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.13382"}},"official":{"repos":["changyong-oh/law2order"],"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/probabilistic-generating-circuits","slug":"probabilistic-generating-circuits","title":"Probabilistic Generating Circuits","date":"2021-02-19","arxiv_id":"2102.09768","repositories_listed":1,"syntology":null},{"url":"/paper/mutually-exciting-point-process-graphs-for","slug":"mutually-exciting-point-process-graphs-for","title":"Mutually exciting point process graphs for modelling dynamic networks","date":"2021-02-11","arxiv_id":"2102.06527","repositories_listed":1,"syntology":null},{"url":"/paper/long-horizon-forecasting-with-temporal-point","slug":"long-horizon-forecasting-with-temporal-point","title":"Long Horizon Forecasting With Temporal Point Processes","date":"2021-01-08","arxiv_id":"2101.02815","repositories_listed":1,"syntology":null},{"url":"/paper/an-information-theoretic-framework-to-measure","slug":"an-information-theoretic-framework-to-measure","title":"An information-theoretic framework to measure the dynamic interaction between neural spike trains","date":"2020-12-15","arxiv_id":"2012.08667","repositories_listed":1,"syntology":null},{"url":"/paper/probabilistic-time-series-forecasting-with-1","slug":"probabilistic-time-series-forecasting-with-1","title":"Probabilistic Time Series Forecasting with Shape and Temporal Diversity","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/sampling-from-a-k-dpp-without-looking-at-all-1","slug":"sampling-from-a-k-dpp-without-looking-at-all-1","title":"Sampling from a k-DPP without looking at all items","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/neural-spatio-temporal-point-processes-1","slug":"neural-spatio-temporal-point-processes-1","title":"Neural Spatio-Temporal Point Processes","date":"2020-11-09","arxiv_id":"2011.04583","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/neural-spatio-temporal-point-processes-1#ran","syntology_url":"https://syntology.ai/paper/2011.04583","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.04583"}},"official":{"repos":["facebookresearch/neural_stpp"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-neural-event-functions-for-ordinary-1","slug":"learning-neural-event-functions-for-ordinary-1","title":"Learning Neural Event Functions for Ordinary Differential Equations","date":"2020-11-08","arxiv_id":"2011.03902","repositories_listed":1,"syntology":null},{"url":"/paper/better-highlighting-creating-sub-sentence","slug":"better-highlighting-creating-sub-sentence","title":"Better Highlighting: Creating Sub-Sentence Summary Highlights","date":"2020-10-20","arxiv_id":"2010.10566","repositories_listed":1,"syntology":null},{"url":"/paper/probabilistic-time-series-forecasting-with","slug":"probabilistic-time-series-forecasting-with","title":"Probabilistic Time Series Forecasting with Structured Shape and Temporal Diversity","date":"2020-10-14","arxiv_id":"2010.07349","repositories_listed":1,"syntology":null},{"url":"/paper/mo-padgan-reparameterizing-engineering","slug":"mo-padgan-reparameterizing-engineering","title":"MO-PaDGAN: Reparameterizing Engineering Designs for Augmented Multi-objective Optimization","date":"2020-09-15","arxiv_id":"2009.07110","repositories_listed":1,"syntology":null},{"url":"/paper/online-community-detection-for-event-streams","slug":"online-community-detection-for-event-streams","title":"Online Estimation and Community Detection of Network Point Processes for Event Streams","date":"2020-09-03","arxiv_id":"2009.01742","repositories_listed":1,"syntology":null},{"url":"/paper/neural-temporal-point-processes-for-modelling","slug":"neural-temporal-point-processes-for-modelling","title":"Neural Temporal Point Processes For Modelling Electronic Health Records","date":"2020-07-27","arxiv_id":"2007.13794","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/neural-temporal-point-processes-for-modelling#ran","syntology_url":"https://syntology.ai/paper/2007.13794","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.13794"}},"official":{"repos":["babylonhealth/neuralTPPs"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/statistical-inference-for-networks-of-high","slug":"statistical-inference-for-networks-of-high","title":"Statistical Inference for Networks of High-Dimensional Point Processes","date":"2020-07-15","arxiv_id":"2007.07448","repositories_listed":1,"syntology":null},{"url":"/paper/prediction-of-spatial-point-processes-1","slug":"prediction-of-spatial-point-processes-1","title":"Prediction of Spatial Point Processes: Regularized Method with Out-of-Sample Guarantees","date":"2020-07-03","arxiv_id":"2007.01592","repositories_listed":1,"syntology":null},{"url":"/paper/fast-and-flexible-temporal-point-processes","slug":"fast-and-flexible-temporal-point-processes","title":"Fast and Flexible Temporal Point Processes with Triangular Maps","date":"2020-06-22","arxiv_id":"2006.12631","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/fast-and-flexible-temporal-point-processes#ran","syntology_url":"https://syntology.ai/paper/2006.12631","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.12631"}},"official":{"repos":["shchur/triangular-tpp"],"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/metaset-exploring-shape-and-property-spaces","slug":"metaset-exploring-shape-and-property-spaces","title":"METASET: Exploring Shape and Property Spaces for Data-Driven Metamaterials Design","date":"2020-06-01","arxiv_id":"2006.02142","repositories_listed":1,"syntology":null},{"url":"/paper/does-terrorism-trigger-online-hate-speech-on","slug":"does-terrorism-trigger-online-hate-speech-on","title":"Does Terrorism Trigger Online Hate Speech? On the Association of Events and Time Series","date":"2020-04-30","arxiv_id":"2004.14733","repositories_listed":1,"syntology":null},{"url":"/paper/dropout-strikes-back-improved-uncertainty","slug":"dropout-strikes-back-improved-uncertainty","title":"Dropout Strikes Back: Improved Uncertainty Estimation via Diversity Sampling","date":"2020-03-06","arxiv_id":"2003.03274","repositories_listed":1,"syntology":null},{"url":"/paper/padgan-a-generative-adversarial-network-for","slug":"padgan-a-generative-adversarial-network-for","title":"PaDGAN: A Generative Adversarial Network for Performance Augmented Diverse Designs","date":"2020-02-26","arxiv_id":"2002.11304","repositories_listed":1,"syntology":null},{"url":"/paper/breaking-hypothesis-testing-for-failure-rates","slug":"breaking-hypothesis-testing-for-failure-rates","title":"Breaking hypothesis testing for failure rates","date":"2020-01-13","arxiv_id":"2001.04045","repositories_listed":1,"syntology":null},{"url":"/paper/contextual-outlier-detection-in-continuous","slug":"contextual-outlier-detection-in-continuous","title":"Event Outlier Detection in Continuous Time","date":"2019-12-19","arxiv_id":"1912.09522","repositories_listed":1,"syntology":{"n":15,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":0,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/contextual-outlier-detection-in-continuous#ran","syntology_url":"https://syntology.ai/paper/1912.09522","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.09522"}},"official":{"repos":["siqil/CPPOD"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/mathttmedgraph-structural-and-temporal","slug":"mathttmedgraph-structural-and-temporal","title":"$\\mathtt{MedGraph:}$ Structural and Temporal Representation Learning of Electronic Medical Records","date":"2019-12-08","arxiv_id":"1912.03703","repositories_listed":1,"syntology":null},{"url":"/paper/mutually-regressive-point-processes","slug":"mutually-regressive-point-processes","title":"Mutually Regressive Point Processes","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/on-two-ways-to-use-determinantal-point","slug":"on-two-ways-to-use-determinantal-point","title":"On two ways to use determinantal point processes for Monte Carlo integration","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/intermittent-demand-forecasting-with-deep","slug":"intermittent-demand-forecasting-with-deep","title":"Intermittent Demand Forecasting with Deep Renewal Processes","date":"2019-11-23","arxiv_id":"1911.10416","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/intermittent-demand-forecasting-with-deep#ran","syntology_url":"https://syntology.ai/paper/1911.10416","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.10416"}},"official":null}},{"url":"/paper/adaptive-sampling-for-stochastic-risk-averse","slug":"adaptive-sampling-for-stochastic-risk-averse","title":"Adaptive Sampling for Stochastic Risk-Averse Learning","date":"2019-10-28","arxiv_id":"1910.12511","repositories_listed":1,"syntology":null},{"url":"/paper/in-conclusion-not-repetition-comprehensive","slug":"in-conclusion-not-repetition-comprehensive","title":"In Conclusion Not Repetition: Comprehensive Abstractive Summarization With Diversified Attention Based On Determinantal Point Processes","date":"2019-09-24","arxiv_id":"1909.10852","repositories_listed":1,"syntology":null},{"url":"/paper/190910367","slug":"190910367","title":"Learning Temporal Attention in Dynamic Graphs with Bilinear Interactions","date":"2019-09-23","arxiv_id":"1909.10367","repositories_listed":1,"syntology":null},{"url":"/paper/batch-active-learning-using-determinantal","slug":"batch-active-learning-using-determinantal","title":"Batch Active Learning Using Determinantal Point Processes","date":"2019-06-19","arxiv_id":"1906.07975","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/batch-active-learning-using-determinantal#ran","syntology_url":"https://syntology.ai/paper/1906.07975","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.07975"}},"official":{"repos":["Stanford-ILIAD/DPP-Batch-Active-Learning"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/reinforcement-learning-of-spatio-temporal","slug":"reinforcement-learning-of-spatio-temporal","title":"Imitation Learning of Neural Spatio-Temporal Point Processes","date":"2019-06-13","arxiv_id":"1906.05467","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-experimental-design-using","slug":"bayesian-experimental-design-using","title":"Bayesian experimental design using regularized determinantal point processes","date":"2019-06-10","arxiv_id":"1906.04133","repositories_listed":1,"syntology":null},{"url":"/paper/190600072","slug":"190600072","title":"Improving the Similarity Measure of Determinantal Point Processes for Extractive Multi-Document Summarization","date":"2019-05-31","arxiv_id":"1906.00072","repositories_listed":1,"syntology":null},{"url":"/paper/learning-nonsymmetric-determinantal-point","slug":"learning-nonsymmetric-determinantal-point","title":"Learning Nonsymmetric Determinantal Point Processes","date":"2019-05-30","arxiv_id":"1905.12962","repositories_listed":1,"syntology":null},{"url":"/paper/fully-neural-network-based-model-for-general","slug":"fully-neural-network-based-model-for-general","title":"Fully Neural Network based Model for General Temporal Point Processes","date":"2019-05-23","arxiv_id":"1905.09690","repositories_listed":1,"syntology":null},{"url":"/paper/patent-citation-dynamics-modeling-via-multi","slug":"patent-citation-dynamics-modeling-via-multi","title":"Patent Citation Dynamics Modeling via Multi-Attention Recurrent Networks","date":"2019-05-22","arxiv_id":"1905.10022","repositories_listed":1,"syntology":null},{"url":"/paper/a-topological-data-analysis-based","slug":"a-topological-data-analysis-based","title":"A topological data analysis based classification method for multiple measurements","date":"2019-04-05","arxiv_id":"1904.02971","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-human-learning-via-spaced","slug":"enhancing-human-learning-via-spaced","title":"Enhancing human learning via spaced repetition optimization","date":"2019-01-22","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/poppy-a-point-process-toolbox-based-on","slug":"poppy-a-point-process-toolbox-based-on","title":"PoPPy: A Point Process Toolbox Based on PyTorch","date":"2018-10-23","arxiv_id":"1810.10122","repositories_listed":1,"syntology":null},{"url":"/paper/determinantal-thinning-of-point-processes","slug":"determinantal-thinning-of-point-processes","title":"Determinantal thinning of point processes with network learning applications","date":"2018-10-09","arxiv_id":"1810.08672","repositories_listed":1,"syntology":null},{"url":"/paper/fast-estimation-of-causal-interactions-using","slug":"fast-estimation-of-causal-interactions-using","title":"Fast Estimation of Causal Interactions using Wold Processes","date":"2018-07-12","arxiv_id":"1807.04595","repositories_listed":1,"syntology":null},{"url":"/paper/a-review-of-network-inference-techniques-for","slug":"a-review-of-network-inference-techniques-for","title":"A Review of Network Inference Techniques for Neural Activation Time Series","date":"2018-06-20","arxiv_id":"1806.08212","repositories_listed":1,"syntology":null},{"url":"/paper/diverse-online-feature-selection","slug":"diverse-online-feature-selection","title":"Diverse Online Feature Selection","date":"2018-06-12","arxiv_id":"1806.04308","repositories_listed":1,"syntology":null},{"url":"/paper/learning-instance-aware-object-detection","slug":"learning-instance-aware-object-detection","title":"Learning Instance-Aware Object Detection Using Determinantal Point Processes","date":"2018-05-28","arxiv_id":"1805.10765","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-inference-in-multi-task-cox-process","slug":"efficient-inference-in-multi-task-cox-process","title":"Efficient Inference in Multi-task Cox Process Models","date":"2018-05-24","arxiv_id":"1805.09781","repositories_listed":1,"syntology":null},{"url":"/paper/deep-reinforcement-learning-of-marked","slug":"deep-reinforcement-learning-of-marked","title":"Deep Reinforcement Learning of Marked Temporal Point Processes","date":"2018-05-23","arxiv_id":"1805.09360","repositories_listed":1,"syntology":null},{"url":"/paper/active-mini-batch-sampling-using-repulsive","slug":"active-mini-batch-sampling-using-repulsive","title":"Active Mini-Batch Sampling using Repulsive Point Processes","date":"2018-04-08","arxiv_id":"1804.02772","repositories_listed":1,"syntology":null},{"url":"/paper/modelling-sparsity-heterogeneity-reciprocity","slug":"modelling-sparsity-heterogeneity-reciprocity","title":"Modelling sparsity, heterogeneity, reciprocity and community structure in temporal interaction data","date":"2018-03-16","arxiv_id":"1803.06070","repositories_listed":1,"syntology":null},{"url":"/paper/leveraging-the-crowd-to-detect-and-reduce-the","slug":"leveraging-the-crowd-to-detect-and-reduce-the","title":"Leveraging the Crowd to Detect and Reduce the Spread of Fake News and Misinformation","date":"2017-11-27","arxiv_id":"1711.09918","repositories_listed":1,"syntology":null},{"url":"/paper/continuous-dr-submodular-maximization","slug":"continuous-dr-submodular-maximization","title":"Continuous DR-submodular Maximization: Structure and Algorithms","date":"2017-11-04","arxiv_id":"1711.02515","repositories_listed":1,"syntology":null},{"url":"/paper/thap-a-matlab-toolkit-for-learning-with","slug":"thap-a-matlab-toolkit-for-learning-with","title":"THAP: A Matlab Toolkit for Learning with Hawkes Processes","date":"2017-08-28","arxiv_id":"1708.09252","repositories_listed":1,"syntology":null},{"url":"/paper/zonotope-hit-and-run-for-efficient-sampling","slug":"zonotope-hit-and-run-for-efficient-sampling","title":"Zonotope hit-and-run for efficient sampling from projection DPPs","date":"2017-05-30","arxiv_id":"1705.10498","repositories_listed":1,"syntology":null},{"url":"/paper/wasserstein-learning-of-deep-generative-point","slug":"wasserstein-learning-of-deep-generative-point","title":"Wasserstein Learning of Deep Generative Point Process Models","date":"2017-05-23","arxiv_id":"1705.08051","repositories_listed":1,"syntology":null},{"url":"/paper/entropic-trace-estimates-for-log-determinants","slug":"entropic-trace-estimates-for-log-determinants","title":"Entropic Trace Estimates for Log Determinants","date":"2017-04-24","arxiv_id":"1704.07223","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/entropic-trace-estimates-for-log-determinants#ran","syntology_url":"https://syntology.ai/paper/1704.07223","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1704.07223"}},"official":null}},{"url":"/paper/faster-greedy-map-inference-for-determinantal","slug":"faster-greedy-map-inference-for-determinantal","title":"Faster Greedy MAP Inference for Determinantal Point Processes","date":"2017-03-09","arxiv_id":"1703.03389","repositories_listed":1,"syntology":null},{"url":"/paper/batched-high-dimensional-bayesian","slug":"batched-high-dimensional-bayesian","title":"Batched High-dimensional Bayesian Optimization via Structural Kernel Learning","date":"2017-03-06","arxiv_id":"1703.01973","repositories_listed":1,"syntology":null},{"url":"/paper/learning-hawkes-processes-from-short-doubly","slug":"learning-hawkes-processes-from-short-doubly","title":"Learning Hawkes Processes from Short Doubly-Censored Event Sequences","date":"2017-02-22","arxiv_id":"1702.07013","repositories_listed":1,"syntology":null},{"url":"/paper/a-dirichlet-mixture-model-of-hawkes-processes","slug":"a-dirichlet-mixture-model-of-hawkes-processes","title":"A Dirichlet Mixture Model of Hawkes Processes for Event Sequence Clustering","date":"2017-01-31","arxiv_id":"1701.09177","repositories_listed":1,"syntology":null},{"url":"/paper/variational-latent-gaussian-process-for","slug":"variational-latent-gaussian-process-for","title":"Variational Latent Gaussian Process for Recovering Single-Trial Dynamics from Population Spike Trains","date":"2016-04-11","arxiv_id":"1604.03053","repositories_listed":1,"syntology":null},{"url":"/paper/low-rank-factorization-of-determinantal-point","slug":"low-rank-factorization-of-determinantal-point","title":"Low-Rank Factorization of Determinantal Point Processes for Recommendation","date":"2016-02-17","arxiv_id":"1602.05436","repositories_listed":1,"syntology":null},{"url":"/paper/learning-granger-causality-for-hawkes","slug":"learning-granger-causality-for-hawkes","title":"Learning Granger Causality for Hawkes Processes","date":"2016-02-14","arxiv_id":"1602.04511","repositories_listed":1,"syntology":null},{"url":"/paper/deep-gaze-i-boosting-saliency-prediction-with","slug":"deep-gaze-i-boosting-saliency-prediction-with","title":"Deep Gaze I: Boosting Saliency Prediction with Feature Maps Trained on ImageNet","date":"2014-11-04","arxiv_id":"1411.1045","repositories_listed":1,"syntology":null},{"url":null,"slug":"diverse-mini-batch-selection-in-reinforcement","title":"Diverse Mini-Batch Selection in Reinforcement Learning for Efficient Chemical Exploration in de novo Drug Design","date":"2025-06-26","arxiv_id":"2506.21158","repositories_listed":0,"syntology":null},{"url":null,"slug":"urban-ris-assisted-hap-networks-performance","title":"Urban RIS-Assisted HAP Networks: Performance Analysis Using Stochastic Geometry","date":"2025-06-18","arxiv_id":"2506.15338","repositories_listed":0,"syntology":null},{"url":null,"slug":"uncovering-social-network-activity-using","title":"Uncovering Social Network Activity Using Joint User and Topic Interaction","date":"2025-06-15","arxiv_id":"2506.12842","repositories_listed":0,"syntology":null},{"url":null,"slug":"interpretable-hybrid-rule-temporal-point","title":"Interpretable Hybrid-Rule Temporal Point Processes","date":"2025-04-15","arxiv_id":"2504.11344","repositories_listed":0,"syntology":null},{"url":null,"slug":"filtering-through-a-topological-lens-homology","title":"Filtering through a topological lens: homology for point processes on the time-frequency plane","date":"2025-04-10","arxiv_id":"2504.07720","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-spatio-temporal-point-processes-advances","title":"Deep spatio-temporal point processes: Advances and new directions","date":"2025-04-08","arxiv_id":"2504.06364","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-stochastic-volatility-approximation-for-a","title":"A stochastic volatility approximation for a tick-by-tick price model with mean-field interaction","date":"2025-04-04","arxiv_id":"2504.03445","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-graph-structure-estimation-for","title":"Dynamic Graph Structure Estimation for Learning Multivariate Point Process using Spiking Neural Networks","date":"2025-04-01","arxiv_id":"2504.01246","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-structure-enhanced-temporal-point","title":"Learning Structure-enhanced Temporal Point Processes with Gromov-Wasserstein Regularization","date":"2025-03-29","arxiv_id":"2503.23002","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-geometry-for-modeling-and-analysis","title":"Stochastic Geometry for Modeling and Analysis of Sensing and Communications: A Survey","date":"2025-03-12","arxiv_id":"2503.09729","repositories_listed":0,"syntology":null},{"url":null,"slug":"per-dpp-sampling-framework-and-its","title":"PER-DPP Sampling Framework and Its Application in Path Planning","date":"2025-03-10","arxiv_id":"2503.07411","repositories_listed":0,"syntology":null},{"url":null,"slug":"differentially-private-synthesis-of-spatial","title":"Differentially private synthesis of Spatial Point Processes","date":"2025-02-25","arxiv_id":"2502.18198","repositories_listed":0,"syntology":null},{"url":null,"slug":"prediction-of-clinical-complication-onset","title":"Prediction of Clinical Complication Onset using Neural Point Processes","date":"2025-02-18","arxiv_id":"2502.13290","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-spatiotemporal-point-processes-trends","title":"Neural Spatiotemporal Point Processes: Trends and Challenges","date":"2025-02-13","arxiv_id":"2502.09341","repositories_listed":0,"syntology":null},{"url":null,"slug":"language-tpp-integrating-temporal-point","title":"Language-TPP: Integrating Temporal Point Processes with Language Models for Event Analysis","date":"2025-02-11","arxiv_id":"2502.07139","repositories_listed":0,"syntology":null},{"url":null,"slug":"negative-dependence-as-a-toolbox-for-machine","title":"Negative Dependence as a toolbox for machine learning : review and new developments","date":"2025-02-11","arxiv_id":"2502.07285","repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-band-diversity-for-feature","title":"Leveraging band diversity for feature selection in EO data","date":"2025-02-07","arxiv_id":"2502.04713","repositories_listed":0,"syntology":null},{"url":null,"slug":"advances-in-temporal-point-processes-bayesian","title":"Advances in Temporal Point Processes: Bayesian, Deep, and LLM Approaches","date":"2025-01-24","arxiv_id":"2501.14291","repositories_listed":0,"syntology":null},{"url":null,"slug":"downlink-performance-of-cell-free-massive","title":"Downlink Performance of Cell-Free Massive MIMO for LEO Satellite Mega-Constellation","date":"2025-01-10","arxiv_id":"2501.05655","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-point-process-model-for-optimizing-repeated","title":"A Point Process Model for Optimizing Repeated Personalized Action Delivery to Users","date":"2025-01-06","arxiv_id":"2501.02961","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-linear-hawkes-processes","title":"Deep Linear Hawkes Processes","date":"2024-12-27","arxiv_id":"2412.19634","repositories_listed":0,"syntology":null},{"url":null,"slug":"applying-the-maximum-entropy-principle-to","title":"Applying the maximum entropy principle to neural networks enhances multi-species distribution models","date":"2024-12-26","arxiv_id":"2412.19217","repositories_listed":0,"syntology":null},{"url":null,"slug":"preventing-conflicting-gradients-in-neural","title":"Preventing Conflicting Gradients in Neural Marked Temporal Point Processes","date":"2024-12-11","arxiv_id":"2412.08590","repositories_listed":0,"syntology":null},{"url":null,"slug":"limit-order-book-event-stream-prediction-with","title":"Limit Order Book Event Stream Prediction with Diffusion Model","date":"2024-11-27","arxiv_id":"2412.09631","repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-event-outlier-detection-in","title":"Unsupervised Event Outlier Detection in Continuous Time","date":"2024-11-25","arxiv_id":"2411.16427","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-bayesian-mixture-model-of-temporal-point","title":"A Bayesian Mixture Model of Temporal Point Processes with Determinantal Point Process Prior","date":"2024-11-07","arxiv_id":"2411.04397","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-execution-under-incomplete","title":"Optimal Execution under Incomplete Information","date":"2024-11-07","arxiv_id":"2411.04616","repositories_listed":0,"syntology":null},{"url":null,"slug":"integrating-ris-into-hap-networks-for","title":"Integrating RIS into HAP Networks for Improved Connectivity","date":"2024-11-06","arxiv_id":"2411.03886","repositories_listed":0,"syntology":null},{"url":null,"slug":"point-processes-with-event-time-uncertainty","title":"Point processes with event time uncertainty","date":"2024-11-05","arxiv_id":"2411.02694","repositories_listed":0,"syntology":null},{"url":null,"slug":"unlocking-point-processes-through-point-set","title":"Unlocking Point Processes through Point Set Diffusion","date":"2024-10-29","arxiv_id":"2410.22493","repositories_listed":0,"syntology":null},{"url":null,"slug":"marked-temporal-bayesian-flow-point-processes","title":"Marked Temporal Bayesian Flow Point Processes","date":"2024-10-25","arxiv_id":"2410.19512","repositories_listed":0,"syntology":null},{"url":null,"slug":"3d-prover-diversity-driven-theorem-proving","title":"3D-Prover: Diversity Driven Theorem Proving With Determinantal Point Processes","date":"2024-10-14","arxiv_id":"2410.11133","repositories_listed":0,"syntology":null},{"url":null,"slug":"eventflow-forecasting-continuous-time-event","title":"EventFlow: Forecasting Continuous-Time Event Data with Flow Matching","date":"2024-10-09","arxiv_id":"2410.07430","repositories_listed":0,"syntology":null},{"url":null,"slug":"federated-neural-nonparametric-point","title":"Federated Neural Nonparametric Point Processes","date":"2024-10-08","arxiv_id":"2410.05637","repositories_listed":0,"syntology":null},{"url":null,"slug":"earthquakenpp-benchmark-datasets-for","title":"EarthquakeNPP: Benchmark Datasets for Earthquake Forecasting with Neural Point Processes","date":"2024-09-27","arxiv_id":"2410.08226","repositories_listed":0,"syntology":null},{"url":"/paper/decomposable-transformer-point-processes","slug":"decomposable-transformer-point-processes","title":"Decomposable Transformer Point Processes","date":"2024-09-26","arxiv_id":"2409.18158","repositories_listed":0,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/decomposable-transformer-point-processes#ran","syntology_url":"https://syntology.ai/paper/2409.18158","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.18158"}},"official":null}}],"record_sha256":"d9cd411a34f16fbb0a371d7aa16ddb499d44dc62f4fd5c91d5f10fbe8f28c166","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}