English
Related papers

Related papers: On Two-Stage Guessing

200 papers

Let $\{X_n\}_{n=0}^{\infty}$ be a stationary real-valued time series with unknown distribution. Our goal is to estimate the conditional expectation of $X_{n+1}$ based on the observations $X_i$, $0\le i\le n$ in a strongly consistent way.…

Probability · Mathematics 2008-06-19 G. Morvai , B. Weiss

We analyze a simple randomized subgradient method for approximating solutions to stochastic systems of convex functional constraints, the only input to the algorithm being the size of minibatches. By introducing a new notion of what is…

Optimization and Control · Mathematics 2021-08-30 James Renegar , Song Zhou

How can we perform efficient inference and learning in directed probabilistic models, in the presence of continuous latent variables with intractable posterior distributions, and large datasets? We introduce a stochastic variational…

Machine Learning · Statistics 2022-12-13 Diederik P Kingma , Max Welling

The simplest example of a quantum information source with memory is a mixed source which emits signals entirely from one of two memoryless quantum sources with given a priori probabilities. Considering a mixed source consisting of a general…

Quantum Physics · Physics 2016-06-27 Felix Leditzky , Nilanjana Datta

We consider an online two-stage stochastic optimization with long-term constraints over a finite horizon of $T$ periods. At each period, we take the first-stage action, observe a model parameter realization and then take the second-stage…

Machine Learning · Computer Science 2024-01-03 Piao Hu , Jiashuo Jiang , Guodong Lyu , Hao Su

Fitting generative models to sequential data typically involves two recursive computations through time, one forward and one backward. The latter could be a computation of the loss gradient (as in backpropagation through time), or an…

Machine Learning · Computer Science 2023-10-23 Azwar Abdulsalam , Joseph G. Makin

We consider the problem of synthesizing a memoryless channel between an unobserved source and a remote terminal. An encoder has access to a partial or noisy version $Z^n = (Z_1, \ldots, Z_n)$ of a remote source sequence $X^n = (X_1, \ldots,…

Information Theory · Computer Science 2025-07-22 Yassine Hamdi , Deniz Gündüz

Consider a Gaussian memoryless multiple source with $m$ components with joint probability distribution known only to lie in a given class of distributions. A subset of $k \leq m$ components are sampled and compressed with the objective of…

Information Theory · Computer Science 2018-03-16 Vinay Praneeth Boda

A simple model of an irreversible process is introduced. The equation of iterations in the model includes a noise generation term. We study the properties of the system when the noise generation term is a stochastic process (e.g. a random…

Chaotic Dynamics · Physics 2007-05-23 M. A. Sozanski , J. J. Zebrowski

In networks, there are often more than one source of capacity. The capacities can be permanently or temporarily owned by the decision maker. Depending on the nature of sources, we identify the permanent capacity, spot market capacity and…

Optimization and Control · Mathematics 2017-02-10 Majid Taghavi , Kai Huang

We consider a two-stage procedure (TSP) for estimating an inverse regression function at a given point, where isotonic regression is used at stage one to obtain an initial estimate and a local linear approximation in the vicinity of this…

Statistics Theory · Mathematics 2011-05-17 Runlong Tang , Moulinath Banerjee , George Michailidis

Multistable processes, that is, processes which are, at each "time", tangent to a stable process, but where the index of stability varies along the path, have been recently introduced as models for phenomena where the intensity of jumps is…

Probability · Mathematics 2010-06-01 Ronan Le Guével , Jacques Lévy-Véhel

This paper considers the problem of minimizing a differentiable function with locally Lipschitz continuous gradient on the algebraic variety of real matrices of upper-bounded rank. This problem is known to enable the formulation of various…

Optimization and Control · Mathematics 2026-03-13 Guillaume Olikier , Kyle A. Gallivan , P. -A. Absil

The goal of a learner, in standard online learning, is to have the cumulative loss not much larger compared with the best-performing function from some fixed class. Numerous algorithms were shown to have this gap arbitrarily close to zero,…

Machine Learning · Computer Science 2013-03-04 Nina Vaits , Edward Moroshko , Koby Crammer

Fixpoints are ubiquitous in computer science and when dealing with quantitative semantics and verification one often considers least fixpoints of (higher-dimensional) functions over the non-negative reals. We show how to approximate the…

Logic in Computer Science · Computer Science 2025-06-16 Paolo Baldan , Sebastian Gurke , Barbara König , Tommaso Padoan , Florian Wittbold

We propose a unified, few-step generative modeling framework based on \emph{cumulative flow maps} for long-range transport in probability space, inspired by flow-map techniques for physical transport and dynamics. At its core is a…

Machine Learning · Computer Science 2026-05-06 Zhiqi Li , Duowen Chen , Yuchen Sun , Bo Zhu

This paper considers sequential adaptive estimation of sparse signals under a constraint on the total sensing effort. The advantage of adaptivity in this context is the ability to focus more resources on regions of space where signal…

Methodology · Statistics 2013-04-03 Dennis Wei , Alfred O. Hero

In this paper, we study phase retrieval under model misspecification and generative priors. In particular, we aim to estimate an $n$-dimensional signal $\mathbf{x}$ from $m$ i.i.d.~realizations of the single index model $y =…

Machine Learning · Statistics 2022-10-12 Zhaoqiang Liu , Xinshao Wang , Jiulong Liu

This paper proposes a reformulation of the scenario-based two-stage unit commitment problem under uncertainty that allows finding unit-commitment plans that perform reasonably well both in expectation and for the worst case realization of…

Optimization and Control · Mathematics 2016-06-21 Ignacio Blanco , Juan M. Morales

The prevailing framework for solving referring expression grounding is based on a two-stage process: 1) detecting proposals with an object detector and 2) grounding the referent to one of the proposals. Existing two-stage solutions mostly…

Computer Vision and Pattern Recognition · Computer Science 2021-03-11 Long Chen , Wenbo Ma , Jun Xiao , Hanwang Zhang , Shih-Fu Chang