Copertina

On Observation Time for Recovering Latent Hawkes Networks

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Linkerhägner, Jonas, Bortolasi, Michele, Baldassari, Lorenzo, de Hoop, Maarten V., Dokmanić, Ivan
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Statistics Theory Information Theory Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Joint Graph Rewiring and Feature Denoising via Spectral Resonance
di: Linkerhägner, Jonas, et al.
Pubblicazione: (2024)

Information-Theoretic Guarantees for Recovering Low-Rank Tensors from Symmetric Rank-One Measurements
di: Kızıldağ, Eren C.
Pubblicazione: (2025)

Asymptotic Theory of Eigenvectors for Latent Embeddings with Generalized Laplacian Matrices
di: Fan, Jianqing, et al.
Pubblicazione: (2025)

Statistical Mean Estimation with Coded Relayed Observations
di: Ling, Yan Hao, et al.
Pubblicazione: (2025)

Order-Optimal Sequential 1-Bit Mean Estimation in General Tail Regimes
di: Lau, Ivan, et al.
Pubblicazione: (2026)

Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity
di: Lau, Ivan, et al.
Pubblicazione: (2025)

Top-$K$ ranking with a monotone adversary
di: Yang, Yuepeng, et al.
Pubblicazione: (2024)

On the Nonasymptotic Scaling Guarantee of Hyperparameter Estimation in Inhomogeneous, Weakly-Dependent Complex Network Dynamical Systems
di: Yu, Yi, et al.
Pubblicazione: (2026)

Time-Uniform Confidence Spheres for Means of Random Vectors
di: Chugg, Ben, et al.
Pubblicazione: (2023)

Generating Rectifiable Measures through Neural Networks
di: Riegler, Erwin, et al.
Pubblicazione: (2024)

A new pathway to generative artificial intelligence by minimizing the maximum entropy
di: Miotto, Mattia, et al.
Pubblicazione: (2025)

Degree Heterogeneity in Higher-Order Networks: Inference in the Hypergraph $\boldsymbolβ$-Model
di: Nandy, Sagnik, et al.
Pubblicazione: (2023)

Graph Attention Network for Node Regression on Random Geometric Graphs with Erdős--Rényi contamination
di: Laha, Somak, et al.
Pubblicazione: (2026)

Information-Geometric Decomposition of Generalization Error in Unsupervised Learning
di: Kim, Gilhan
Pubblicazione: (2026)

Efficient Sampling with Discrete Diffusion Models: Sharp and Adaptive Guarantees
di: Dmitriev, Daniil, et al.
Pubblicazione: (2026)

Sample efficient inductive matrix completion with noise and inexact side information
di: Yang, Yuepeng, et al.
Pubblicazione: (2026)

Decoupled Descent: Exact Test Error Tracking Via Approximate Message Passing
di: Lovig, Max
Pubblicazione: (2026)

Diffusion Models Are Statistically Optimal for Learning Low-Dimensional Multi-Modal Distributions
di: Wu, Jingda, et al.
Pubblicazione: (2026)

Breaking the Finite-Sample Barrier in Entropy Coupling
di: Asoodeh, Shahab, et al.
Pubblicazione: (2026)

Orthogonal Approximate Message Passing Algorithms for Rectangular Spiked Matrix Models with Rotationally Invariant Noise
di: Chen, Haohua, et al.
Pubblicazione: (2026)

Minimax optimal differentially private synthetic data for smooth queries
di: Ding, Rundong, et al.
Pubblicazione: (2026)

Accurate Evaluation of Quickest Changepoint Detectors via Non-parametric Survival Analysis
di: Miyagawa, Taiki, et al.
Pubblicazione: (2026)

Minimax optimal submatrix detection: Sharp non-asymptotic rates
di: Knight, Parker, et al.
Pubblicazione: (2026)

Adaptation to Intrinsic Dependence in Diffusion Language Models
di: Zhao, Yunxiao, et al.
Pubblicazione: (2026)

Optimal training-conditional regret for online conformal prediction
di: Liang, Jiadong, et al.
Pubblicazione: (2026)

Thompson sampling: Precise arm-pull dynamics and adaptive inference
di: Han, Qiyang
Pubblicazione: (2026)

Instance-Optimal Estimation with Multiple LLM Judges on a Budget
di: Lee, Junghyun, et al.
Pubblicazione: (2026)

Price of Quality: Sufficient Conditions for Sparse Recovery using Mixed-Quality Data
di: Chaabouni, Youssef, et al.
Pubblicazione: (2026)

On the Sample Complexity of Robust Binary Hypothesis Testing
di: Vallinayagam, Shankar, et al.
Pubblicazione: (2026)

Fine-Grained Uncertainty Quantification via Collisions
di: Friedbaum, Jesse, et al.
Pubblicazione: (2024)

Statistical-Computational Trade-offs in Tensor PCA and Related Problems via Communication Complexity
di: Dudeja, Rishabh, et al.
Pubblicazione: (2022)

Online Clustering of Data Sequences with Bandit Information
di: Chandran, G Dhinesh, et al.
Pubblicazione: (2025)

Efficient Unbiased Sparsification
di: Barnes, Leighton, et al.
Pubblicazione: (2024)

Minimax Optimality of Score-based Diffusion Models: Beyond the Density Lower Bound Assumptions
di: Zhang, Kaihong, et al.
Pubblicazione: (2024)

Characterizing Dependence of Samples along the Langevin Dynamics and Algorithms via Contraction of $Φ$-Mutual Information
di: Liang, Jiaming, et al.
Pubblicazione: (2024)

Orthogonal Approximate Message Passing with Optimal Spectral Initializations for Rectangular Spiked Matrix Models
di: Chen, Haohua, et al.
Pubblicazione: (2025)

On Robust Hypothesis Testing with respect to the Hellinger Distance
di: Modak, Eeshan, et al.
Pubblicazione: (2025)

On the sample complexity of parameter estimation in logistic regression with normal design
di: Hsu, Daniel, et al.
Pubblicazione: (2023)

Distribution free M-estimation
di: Areces, Felipe, et al.
Pubblicazione: (2025)

Representatividad Muestral en la Incertidumbre Simétrica Multivariada para la Selección de Atributos
di: Sosa-Cabrera, Gustavo
Pubblicazione: (2024)