English
Related papers

Related papers: Path Decomposition of Spectrally Negative Levy Pro…

200 papers

Path representations are critical in a variety of transportation applications, such as estimating path ranking in path recommendation systems and estimating path travel time in navigation systems. Existing studies often learn task-specific…

Machine Learning · Computer Science 2021-06-18 Sean Bin Yang , Chenjuan Guo , Jilin Hu , Jian Tang , Bin Yang

This paper addresses the question of predicting when a positive self-similar Markov process X attains its pathwise global supremum or infimum before hitting zero for the first time (if it does at all). This problem has been studied in…

Probability · Mathematics 2014-09-09 Erik Baurdoux , Andreas Kyprianou , Curdin Ott

Two different ways of trimming the sample path of a stochastic process in D[0, 1]: global ("trim as you go") trimming and record time ("lookback") trimming are analysed to find conditions for the corresponding operators to be continuous…

Probability · Mathematics 2017-06-02 Boris Buchmann , Yuguang F. Ipsen , Ross A. Maller

This work addresses inverse linear optimization where the goal is to infer the unknown cost vector of a linear program. Specifically, we consider the data-driven setting in which the available data are noisy observations of optimal…

Optimization and Control · Mathematics 2021-12-07 Rishabh Gupta , Qi Zhang

The transmission matrix (TM) is a representation to describe the light scattering process through a scattering medium. The degree of control elements in TM is correlated with the capacity of evaluating enormous equations with tremendous…

Optics · Physics 2020-11-25 Shu Guo , Hao Zhang , Wenxue Li , Lin Pang

For spectrally negative L\'evy processes, we prove several fluctuation results involving a general draw-down time, which is a downward exit time from a dynamic level that depends on the running maximum of the process. In particular, we find…

Probability · Mathematics 2019-07-17 Bo Li , Nhat Linh Vu , Xiaowen Zhou

Path-following algorithms are frequently used in composite optimization problems where a series of subproblems, with varying regularization hyperparameters, are solved sequentially. By reusing the previous solutions as initialization,…

Optimization and Control · Mathematics 2021-12-10 Eugene Ndiaye , Ichiro Takeuchi

We study a first passage time of a L\'evy process over a positive constant level. In the spectrally negative case we give conditions for absolutely continuity of the distributions of the first passage times. The tail asymptotics of their…

Probability · Mathematics 2023-03-16 Shunsuke Kaji , Muneya Matsui

We establish a systematic solution method for optimal stopping problems of spectrally negative L\'evy processes. Our approach relies essentially on the potential theory, in particular the Riesz decomposition and the maximum principle. Using…

Optimization and Control · Mathematics 2026-02-25 Masahiko Egami , Tomohiro Koike

Material decomposition refers to using the energy dependence of material physical properties to differentiate materials in a sample, which is a very important application in computed tomography(CT). In propagation-based X-ray phase-contrast…

Medical Physics · Physics 2023-12-01 Suyu Liao , Huitao Zhang , Peng Zhang , Yining Zhu

We consider a spectrally negative branching L{\'e}vy process in which particles are killed upon crossing below zero. It is known that such a process becomes extinct almost surely if the drift toward -$\infty$ is sufficiently strong to…

Probability · Mathematics 2025-06-06 Christophe Profeta

We study subexponential tail asymptotics for the distribution of the maximum $M_t:=\sup_{u\in[0,t]}X_u$ of a process $X_t$ with negative drift for the entire range of $t>0$. We consider compound renewal processes with linear drift and…

Probability · Mathematics 2016-11-22 Dmitry Korshunov

The classical notion of L\'evy process is generalized to one that takes as its values probabilities on a first order model equipped with a commutative semigroup. This is achieved by applying a convolution product on definable probabilities…

Logic · Mathematics 2009-10-27 Siu-Ah Ng

In present paper we propose seemingly new method for finding solutions of some types of nonlinear PDEs in closed form. The method is based on decomposition of nonlinear operators on sequence of operators of lower orders. It is shown that…

Mathematical Physics · Physics 2007-05-23 Yu. N. Kosovtsov

An obvious way to simulate a L\'evy process $X$ is to sample its increments over time $1/n$, thus constructing an approximating random walk $X^{(n)}$. This paper considers the error of such approximation after the two-sided reflection map…

Probability · Mathematics 2018-01-04 Søren Asmussen , Jevgenijs Ivanovs

We consider a branching Markov process in continuous time in which the particles evolve independently as spectrally negative L\'evy processes. When the branching mechanism is critical or subcritical, the process will eventually die and we…

Probability · Mathematics 2022-11-23 Christophe Profeta

We investigate the upper tail probabilities of the all-time maximum of a stable L\'evy process with a power negative drift. The asymptotic behaviour is shown to be exponential in the spectrally negative case and polynomial otherwise, with…

Probability · Mathematics 2018-06-05 Christophe Profeta , Thomas Simon

In this work, we introduce a new deep learning approach based on diffusion posterior sampling (DPS) to perform material decomposition from spectral CT measurements. This approach combines sophisticated prior knowledge from unsupervised…

Image and Video Processing · Electrical Eng. & Systems 2024-02-07 Xiao Jiang , Grace J. Gang , J. Webster Stayman

For a spectrally negative L\'evy process $X$, consider $g_t$, the last time $X$ is below the level zero before time $t\geq 0$. We use a perturbation method for L\'evy processes to derive an It\^o formula for the three-dimensional process…

Probability · Mathematics 2025-06-04 Erik J. Baurdoux , J. M. Pedraza

We consider a suboptimal solution path algorithm for the Support Vector Machine. The solution path algorithm is an effective tool for solving a sequence of a parametrized optimization problems in machine learning. The path of the solutions…

Machine Learning · Computer Science 2011-05-04 Masayuki Karasuyama , Ichiro Takeuchi