arXiv Machine Learning
Jun 2
Theoretical Analysis of Engression and Reverse Markov Engression
arXiv:2606. 01002v1 Announce Type: cross Abstract: Engression is a recently proposed and effective framework for conditional distribution learning.
Generative sequence modeling for infinite memory processes via predictive states
Related stories
arXiv AI
Jun 2
Why Do Time Series Models Need Long Context Windows?
arXiv:2606. 01999v1 Announce Type: cross Abstract: Modern deep learning models for forecasting groups of time series rely on increasingly longer observation windows.
arXiv Machine Learning
Jul 21
Semi-Supervised Conditional Generative Learning through Stochastic Interpolation and Sufficient Representations
arXiv:2607. 16725v1 Announce Type: cross Abstract: Conditional generative modeling remains a challenging problem in semi-supervised settings where labeled data is scarce but unlabeled samples are abundant.
arXiv Machine Learning
Jul 28
Numerical Investigation of Sequence Modeling Theory using Controllable Memory Functions
arXiv:2506. 05678v3 Announce Type: replace Abstract: The evolution of sequence modeling architectures, from recurrent neural networks and convolutional models to Transformers and structured state-space models, reflects ongoing efforts to address the diverse temporal dependencies inherent in sequential data.
arXiv AI
Aug 7
The Impossibility Triangle of Long-Context Modeling
arXiv:2605. 05066v2 Announce Type: replace-cross Abstract: We identify and prove a fundamental trade-off governing long-sequence models: no model can simultaneously achieve (i) per-step computation independent of sequence length (Efficiency), (ii) state size independent of sequence length (Compactness), and (iii) the ability to recall a number of historical facts proportional to sequence length (Recall).
arXiv AI
Jun 2
Ideas in Inference-time Scaling can Benefit Generative Pre-training Algorithms
arXiv:2503. 07154v3 Announce Type: replace-cross Abstract: Generative pre-training is often framed through a false dichotomy between autoregressive models for discrete signals and diffusion models for continuous signals.
arXiv Statistics ML
Sep 21
Neural composite likelihood estimation: simulation based inference for time series
Neural Composite Likelihood Estimation (NCLE) extends simulation‑based inference to high‑dimensional time series by partitioning long sequences into equal‑sized batches. For each batch, a neural network estimates the likelihood via conditional density estimation, and the product of these batch likelihoods forms an approximate composite likelihood. Frequentist inference is then performed by maximizing this composite likelihood to obtain a point estimate and by estimating the Godambe information matrix to derive confidence intervals.
Hugging Face Trending Papers
Sep 17
Next-token functional estimation
Suppose we observe the first $n$ points of a sequence of random variables having length $n+1$, and wish to estimate a functional of the unobserved final point and the empirical measure of the $n$ obse...
arXiv Machine Learning
Sep 11
Particle GFlowNets: Rethinking Generative Marginalization Models
The paper introduces Particle GFlowNets, showing that Generative Marginalization Models (MaMs) are equivalent to Generative Flow Networks. It extends MaMs to non‑autoregressive sampling and proposes an automatic full‑state rejuvenation criterion based on the Gelman‑Rubin statistic to accelerate learning. Experiments demonstrate significant training speedups in large combinatorial spaces.
arXiv Machine Learning
Sep 21
Probabilistic Forecasting of Business Process Executions with Neural Temporal Point Processes
arXiv:2609.21382v1 Announce Type: new Abstract: Operators of service-based systems act on forecasts of how a running execution will continue, and such a forecast is actionable only if its reliability...
arXiv AI
Jun 3
Latent Laplace Diffusion for Irregular Multivariate Time Series
arXiv:2605. 19805v2 Announce Type: replace-cross Abstract: Irregular multivariate time series impose a trade-off for long-horizon forecasting: discrete methods can distort temporal structure via re-gridding, while continuous-time models often require sequential solvers prone to drift.
arXiv Machine Learning
Jul 15
LatentFlow: A General Framework for Conditioning Stochastic Processes
arXiv:2607. 12922v1 Announce Type: cross Abstract: Stochastic-process models are, as a rule, far easier to simulate than to condition.