English
Related papers

Related papers: Practical Boundary Degeneracy and Reverse-Martinga…

200 papers

This paper presents the asymptotic theory for nondegenerate $U$-statistics of high frequency observations of continuous It\^{o} semimartingales. We prove uniform convergence in probability and show a functional stable central limit theorem…

Probability · Mathematics 2014-09-10 Mark Podolskij , Christian Schmidt , Johanna F. Ziegel

Semimartingale reflecting Brownian motions (SRBMs) living in the closures of domains with piecewise smooth boundaries are of interest in applied probability because of their role as heavy traffic approximations for some stochastic networks.…

Probability · Mathematics 2009-09-29 W. Kang , R. J. Williams

We consider a branching random walk on the line. Biggins and Kyprianou [6] proved that, in the boundary case, the associated derivative martingale converges almost surly to a finite nonnegative limit, whose law serves as a fixed point of a…

Probability · Mathematics 2014-02-25 Xinxin Chen

The classical inverse first passage time problem asks whether, for a Brownian motion $(B_t)_{t\geq 0}$ and a positive random variable $\xi$, there exists a barrier $b:\mathbb{R}_+\to\mathbb{R}$ such that $\mathbb{P}\{B_s>b(s), 0\leq s \leq…

Probability · Mathematics 2021-02-18 Boris Ettinger , Alexandru Hening , Tak Kwong Wong

We study the almost-sure termination problem for probabilistic programs. First, we show that supermartingales with lower bounds on conditional absolute difference provide a sound approach for the almost-sure termination problem. Moreover,…

Logic in Computer Science · Computer Science 2018-08-24 Mingzhang Huang , Hongfei Fu , Krishnendu Chatterjee

We analyze an optimal stopping problem with random maturity under a nonlinear expectation with respect to a weakly compact set of mutually singular probabilities $\mathcal{P}$. The maturity is specified as the hitting time to level $0$ of…

Probability · Mathematics 2016-07-08 Erhan Bayraktar , Song Yao

The statistics and machine learning communities have recently seen a growing interest in classification-based approaches to two-sample testing. The outcome of a classification-based two-sample test remains a rejection decision, which is not…

Statistics Theory · Mathematics 2022-11-15 Loris Michel , Jeffrey Näf , Nicolai Meinshausen

Online learning methods yield sequential regret bounds under minimal assumptions and provide in-expectation risk bounds for statistical learning. However, despite the apparent advantage of online guarantees over their statistical…

Machine Learning · Computer Science 2023-08-16 Dirk van der Hoeven , Nikita Zhivotovskiy , Nicolò Cesa-Bianchi

Rice's theorem shows that nontrivial extensional properties of partial recursive functions are undecidable. For finite weighted Boolean optimization/CSP-style slices, a Rice-style structural analogue holds for tractability classification:…

Computational Complexity · Computer Science 2026-05-28 Tristan Simas

We suggest to construct infinite stochastic binary sequences by associating one of the two symbols of the sequence with the renewal times of an underlying renewal process. Focusing on stationary binary sequences corresponding to delayed…

Mathematical Physics · Physics 2023-04-24 Marco Zamparo

We reconsider the stochastic (sub)gradient approach to the unconstrained primal L1-SVM optimization. We observe that if the learning rate is inversely proportional to the number of steps, i.e., the number of times any training pattern is…

Machine Learning · Computer Science 2014-01-28 Constantinos Panagiotakopoulos , Petroula Tsampouka

Whole robustness is a nice property to have for statistical models. It implies that the impact of outliers gradually vanishes as they approach plus or minus infinity. So far, the Bayesian literature provides results that ensure whole…

Methodology · Statistics 2018-08-14 Alain Desgagné , Philippe Gagnon

Regression problems with bounded continuous outcomes frequently arise in real-world statistical and machine learning applications, such as the analysis of rates and proportions. A central challenge in this setting is predicting a response…

Machine Learning · Statistics 2025-07-21 Zhanli Wu , Fabrizio Leisen , F. Javier Rubio

Data separation is a well-studied phenomenon that can cause problems in the estimation and inference from binary response models. Complete or quasi-complete separation occurs when there is a combination of regressors in the model whose…

Methodology · Statistics 2021-01-19 Susanne Köll , Ioannis Kosmidis , Christian Kleiber , Achim Zeileis

We prove a martingale-coboundary representation for random fields with a completely commuting filtration. For random variables in L2 we present a necessary and sufficient condition which is a generalization of Heyde's condition for one…

Probability · Mathematics 2017-06-27 Dalibor Volny

We investigate the properties of a discrete-time martingale $\{X_m\}_{m\in \mathbb Z_{\geq 0}}$, where all differences between adjacent random variables are limited to be not more than a constant as a promise. In this situation, it is known…

Probability · Mathematics 2019-05-16 Go Kato

Evaluating joint probabilities of potential outcomes and observed variables, and their linear combinations, is a fundamental challenge in causal inference. This paper addresses the bounding and identification of these probabilities in…

Machine Learning · Statistics 2026-02-24 Naoya Hashimoto , Yuta Kawakami , Jin Tian

Let $(X_t)$ be a discrete time Markov chain on a general state space. It is well-known that if $(X_t)$ is aperiodic and satisfies a drift and minorization condition, then it converges to its stationary distribution $\pi$ at an exponential…

Probability · Mathematics 2019-08-20 Daniel C. Jerison

Consider a discrete-time optimal selection problem where one observes a sequence of independent Bernoulli trials and receives a nonnegative reward upon stopping on a success. The aim is to find a single-choice strategy that maximises the…

Probability · Mathematics 2025-12-30 Zakaria Derbazi

Motivated by the success of bounded model checking framework for finite state machines, Ouaknine and Worrell proposed a time-bounded theory of real-time verification by claiming that restriction to bounded-time recovers decidability for…

Logic in Computer Science · Computer Science 2014-08-18 Shankara Narayanan Krishna , Lakshmi Manasa , Ashutosh Trivedi
‹ Prev 1 3 4 5 6 7 10 Next ›