Related papers: Asymptotic Classification Error for Heavy-Tailed R…

We introduce a point process regression model that is applicable to price models and limit order book models. Hawkes type autoregression in the intensity process is generalized to a stochastic regression to covariate processes. We establish…

We consider the passage time problem for L\'evy processes, emphasising heavy tailed cases. Results are obtained under quite mild assumptions, namely, drift to $-\infty$ a.s. of the process, possibly at a linear rate (the finite mean case),…

This paper proposes a notion of branching bisimilarity for non-deterministic probabilistic processes. In order to characterize the corresponding notion of rooted branching probabilistic bisimilarity, an equational theory is proposed for a…

We consider the problem of detecting abrupt changes (i.e., large jump discontinuities) in the rate function of a point process. The rate function is assumed to be fully unknown, non-stationary, and may itself be a random process that…

Ordinal classification problems, where labels exhibit a natural order, are prevalent in high-stakes fields such as medicine and finance. Accurate uncertainty quantification, including the decomposition into aleatoric (inherent variability)…

The long-tail distribution of the visual world poses great challenges for deep learning based classification models on how to handle the class imbalance problem. Existing solutions usually involve class-balancing strategies, e.g., by loss…

Learning a sequence of tasks without access to i.i.d. observations is a widely studied form of continual learning (CL) that remains challenging. In principle, Bayesian learning directly applies to this setting, since recursive and one-off…

We develop asymptotic approximations that can be applied to sequential estimation and inference problems, adaptive randomized controlled trials, and related settings. In batched adaptive settings where the decision at one stage can affect…

Parametric high-dimensional regression analysis requires the usage of regularization terms to get interpretable models. The respective estimators can be regarded as regularized M-functionals which are naturally highly nonlinear. We study…

In real-world scenarios, the number of training samples across classes usually subjects to a long-tailed distribution. The conventionally trained network may achieve unexpected inferior performance on the rare class compared to the frequent…

A weighted Shiryaev-Roberts change detection procedure is shown to approximately minimize the expected delay to detection as well as higher moments of the detection delay among all change-point detection procedures with the given low…

Randomly scaled scale-decorated Poisson point process is introduced recently in Bhattacharya et al. [2017] where it appeared as weak limit of a sequence of point processes in the context of branching random walk. In this article, we obtain…

We study the asymptotic behavior of the least squares estimators of the unknown parameters of bifurcating autoregressive processes. Under very weak assumptions on the driven noise of the process, namely conditional pair-wise independence…

In this paper, we develop asymptotic theories for a class of latent variable models for large-scale multi-relational networks. In particular, we establish consistency results and asymptotic error bounds for the (penalized) maximum…

We construct a class of nonnegative martingale processes that oscillate indefinitely with high probability. For these processes, we state a uniform rate of the number of oscillations and show that this rate is asymptotically close to the…

Branching processes in a random environment are natural generalisations of Galton-Watson processes. In this paper we analyse the asymptotic decay of the survival probability for a sequence of slightly supercritical branching processes in an…

We study a class of iterated empirical risk minimization (ERM) procedures in which two successive ERMs are performed on the same dataset, and the predictions of the first estimator enter as an argument in the loss function of the second.…

We prove the first generalization bound for large-margin halfspaces that is asymptotically tight in the tradeoff between the margin, the fraction of training points with the given margin, the failure probability and the number of training…

We consider two independent random variables with the given tail asymptotic (e.g. power or exponential). We find tail asymptotic for their sum and product. This is done by some cumbersome but purely technical computations and requires the…

We find upper bounds for the probability of underestimation and overestimation errors in penalized likelihood context tree estimation. The bounds are explicit and applies to processes of not necessarily finite memory. We allow for general…