arXiv research

Greedy selection works well in a toy model of independent increments.

We consider the problem of maximizing expected utility from terminal wealth in models with stochastic factors. Using martingale methods and a conditioning argument, we determine the optimal strategy for power utility under the assumption that the increments of the asset price are independent conditionally on the factor…

For a large class of vanilla contingent claims, we establish an explicit Föllmer-Schweizer decomposition when the underlying is a process with independent increments (PII) and an exponential of a PII process. This allows to provide an efficient algorithm for solving the mean variance hedging problem. Applications to mo…

We develop importance sampling based efficient simulation techniques for three commonly encountered rare event probabilities associated with random walks having i.i.d. regularly varying increments; namely, 1) the large deviation probabilities, 2) the level crossing probabilities, and 3) the level crossing probabilities…

We analyze the question whether sliding window time averages applied to stationary increment processes converge to a limit in probability. The question centers on averages, correlations, and densities constructed via time averages of the increment x(t,T)=x(t+T)-x(t)and the assumption is that the increment is distribute…

Time and Sales of corn futures traded electronically on the CME Group Globex are studied. Theories of continuous prices turn upside down reality of intra-day trading. Prices and their increments are discrete and obey lattice probability distributions. A function for systematic evolution of futures trading volume is pro…

We introduce a new class of processes for the evaluation of multivariate equity derivatives. The proposed setting is well suited for the application of the standard copula function theory to processes, rather than variables, and easily enables to enforce the martingale pricing requirement. The martingale condition is i…

We determine the variance-optimal hedge when the logarithm of the underlying price follows a process with stationary independent increments in discrete or continuous time. Although the general solution to this problem is known as backward recursion or backward stochastic differential equation, we show that for this cla…

The generalized correlation approach, which has been successfully used in statistical radio physics to describe non-Gaussian random processes, is proposed to describe stochastic financial processes. The generalized correlation approach has been used to describe a non-Gaussian random walk with independent, identically d…

The state of a stochastic process evolving over a time $t$ is typically assumed to lie on a normal distribution whose width scales like $t^{1/2}$. However, processes where the probability distribution is not normal and the scaling exponent differs from $\frac{1}{2}$ are known. The search for possible origins of such "a…

By applying the multifractal detrended fluctuation analysis to the high-frequency tick-by-tick data from Deutsche Börse both in the price and in the time domains, we investigate multifractal properties of the time series of logarithmic price increments and inter-trade intervals of time. We show that both quantities rev…

This paper tackles federated incremental learning with dynamic memory allocation for improved model performance in non-IID data.

In this paper we study the exponential functionals of the processes $X$ with independent increments , namely $I_t= \int _0^t\exp(-X_s)ds, _,\,\, t\geq 0,$ and also $I_{\infty}= \int _0^{\infty}\exp(-X_s)ds.$ When $X$ is a semi-martingale with absolutely continuous characteristics, we derive recurrent integral equat…

Continuous appearance shifts such as changes in weather and lighting conditions can impact the performance of deployed machine learning models. While unsupervised domain adaptation aims to address this challenge, current approaches do not utilise the continuity of the occurring shifts. In particular, many robotics appl…

A fast method for decentralized non-convex optimization over networks.

Study shows accuracy of neural networks depends more on error location than percentage of error.

When observations are organized into groups where commonalties exist amongst them, the dependent random measures can be an ideal choice for modeling. One of the propositions of the dependent random measures is that the atoms of the posterior distribution are shared amongst groups, and hence groups can borrow informatio…

Method predicts LFSM increments from past observations using codifference.

DFI maps covariates to latent representations for feature importance.

The fractional Poisson process (FPP) is a counting process with independent and identically distributed inter-event times following the Mittag-Leffler distribution. This process is very useful in several fields of applied and theoretical physics including models for anomalous diffusion. Contrary to the well-known Poiss…

Paper presents IMRCs for evolving tasks with forward and backward learning.

We introduce incremental variational inference and apply it to latent Dirichlet allocation (LDA). Incremental variational inference is inspired by incremental EM and provides an alternative to stochastic variational inference. Incremental LDA can process massive document collections, does not require to set a learning …

We consider the discretized version of a (continuous-time) two-factor model introduced by Benth and coauthors for the electricity markets. For this model, the underlying is the exponent of a sum of independent random variables. We provide and test an algorithm, which is based on the celebrated Foellmer-Schweizer decomp…

New proof shows incremental flow models are essential for universal generation.

Paper proposes faster incremental subclass discriminant analysis.

Framework improves financial predictions with deep learning models.

It is well documented that a model for the underlying asset price process that seeks to capture the behaviour of the market prices of vanilla options needs to exhibit both diffusion and jump features. In this paper we assume that the asset price process $S$ is Markov with cadlag paths and propose a scheme for computing…

Paper tackles few-shot class-incremental learning with a neural gas network.

Validation is one of the most important aspects of clustering, but most approaches have been batch methods. Recently, interest has grown in providing incremental alternatives. This paper extends the incremental cluster validity index (iCVI) family to include incremental versions of Calinski-Harabasz (iCH), I index and …

A new model learns preferences incrementally without personal data.

Incremental versions of batch algorithms are often desired, for increased time efficiency in the streaming data setting, or increased memory efficiency in general. In this paper we present a novel algorithm for incremental kernel PCA, based on rank one updates to the eigendecomposition of the kernel matrix, which is mo…

Continual lifelong learning is essential to many applications. In this paper, we propose a simple but effective approach to continual deep learning. Our approach leverages the principles of deep model compression, critical weights selection, and progressive networks expansion. By enforcing their integration in an itera…

This paper introduces Deep Incremental Boosting, a new technique derived from AdaBoost, specifically adapted to work with Deep Learning methods, that reduces the required training time and improves generalisation. We draw inspiration from Transfer of Learning approaches to reduce the start-up time to training each incr…

Paper proposes CNE-net to tackle incremental learning in (T)ACSA tasks.

This paper presents a novel approach for incremental semiparametric inverse dynamics learning. In particular, we consider the mixture of two approaches: Parametric modeling based on rigid body dynamics equations and nonparametric modeling based on incremental kernel methods, with no prior information on the mechanical …

GraphSAIL updates GNN-based recommender models incrementally to reduce computation time and improve frequent updates.

A leading hypothesis for the surprising generalization of neural networks is that the dynamics of gradient descent bias the model towards simple solutions, by searching through the solution space in an incremental order of complexity. We formally define the notion of incremental learning dynamics and derive the conditi…

We propose an algorithm for incremental learning of classifiers. The proposed method enables an ensemble of classifiers to learn incrementally by accommodating new training data. We use an effective mechanism to overcome the stability-plasticity dilemma. In incremental learning, the general convention is to use only th…

Data is continuously generated by modern data sources, and a recent challenge in machine learning has been to develop techniques that perform well in an incremental (streaming) setting. In this paper, we investigate the problem of private machine learning, where as common in practice, the data is not given at once, but…

We study the stochastic multi-armed bandit problem in the case when the arm samples are dependent over time and generated from so-called weak $\cC$-mixing processes. We establish a $\cC-$Mix Improved UCB agorithm and provide both problem-dependent and independent regret analysis in two different scenarios. In the first…

Independent component analysis (ICA) is a widespread data exploration technique, where observed signals are modeled as linear mixtures of independent components. From a machine learning point of view, it amounts to a matrix factorization problem with a statistical independence criterion. Infomax is one of the most used…

New algorithm improves on EM for streaming data, outperforming existing methods.

Support Vector Data Description (SVDD) is a popular outlier detection technique which constructs a flexible description of the input data. SVDD computation time is high for large training datasets which limits its use in big-data process-monitoring applications. We propose a new iterative sampling-based method for SVDD…

Incremental clustering approaches have been proposed for handling large data when given data set is too large to be stored. The key idea of these approaches is to find representatives to represent each cluster in each data chunk and final data analysis is carried out based on those identified representatives from all t…

Under the Basel II standards, the Operational Risk (OpRisk) advanced measurement approach is not prescriptive regarding the class of statistical model utilised to undertake capital estimation. It has however become well accepted to utlise a Loss Distributional Approach (LDA) paradigm to model the individual OpRisk loss…

It was recently shown that architectural, regularization and rehearsal strategies can be used to train deep models sequentially on a number of disjoint tasks without forgetting previously acquired knowledge. However, these strategies are still unsatisfactory if the tasks are not disjoint but constitute a single increme…

Tensor decompositions are invaluable tools in analyzing multimodal datasets. In many real-world scenarios, such datasets are far from being static, to the contrary they tend to grow over time. For instance, in an online social network setting, as we observe new interactions over time, our dataset gets updated in its "t…

A new generative classification strategy outperforms existing methods in class-incremental learning.