Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

4.9%9.7%14.6%19.4% · Mar 202019922001200920172026
48 results for evolving processes

How can we effectively encode evolving information over dynamic graphs into low-dimensional representations? In this paper, we propose DyRep, an inductive deep representation learning framework that learns a set of functions to efficiently produce low-dimensional node embeddings that evolves over time. The learned embe…

2018-03-11abs ↗pdf ↗

A scalable framework uses Langevin sampling to approximate neural network models of evolving processes.

problem Uncertainty quantification in neural network models of dynamic systems.
method Flexible data model based on NODE, joint learning of data model and posterior parameters, Langevin sampling.
result Demonstrated performance on chemical reaction and material physics data, compared favorably to variational inference.

Many networks are complex dynamical systems, where both attributes of nodes and topology of the network (link structure) can change with time. We propose a model of co-evolving networks where both node at- tributes and network structure evolve under mutual influence. Specifically, we consider a mixed membership stochas…

2011-06-14abs ↗pdf ↗

New method detects anomalies in computing centers' logs.

problem Anomaly detection in continuously changing log data for predictive maintenance.
method Evolving granular classifiers using Fuzzy-set-Based evolving Modeling and evolving Granular Neural Network.
result Classification model prioritizes maintenance based on anomaly severity.

Sentiment analysis consists of evaluating opinions or statements from the analysis of text. Among the methods used to estimate the degree in which a text expresses a given sentiment, are those based on Gaussian Processes. However, traditional Gaussian Processes methods use a predefined kernel with hyperparameters that …

2019-04-01abs ↗pdf ↗

Method learns evolving policies in healthcare contexts.

problem Understanding non-stationary behavior in evolving decision-making processes.
method Inverse Contextual Bandits (ICB) approach for learning interpretable representations of non-stationary behavior.
result Demonstrated applicability and accuracy of ICB method in liver transplantation policies.

The paper develops a neural network-based method for detecting change points in large-scale time-evolving data.

problem Detecting and locating change points in multivariate time-evolving data.
method Two-step procedure involving neural network training and test error function calibration over moving windows.
result Consistent estimates for the number and locations of change points under temporal dependence.

An artificial stock market is established based on multi-agent . Each agent has a limit memory of the history of stock price, and will choose an action according to his memory and trading strategy. The trading strategy of each agent evolves ceaselessly as a result of self-teaching mechanism. Simulation results exhibit …

2004-06-07abs ↗pdf ↗

Under proportional transaction costs, a price process is said to have a consistent price system, if there is a semimartingale with an equivalent martingale measure that evolves within the bid-ask spread. We show that a continuous, multi-asset price process has a consistent price system, under arbitrarily small proporti…

2013-10-29abs ↗pdf ↗

BSA-TNP improves NP scalability and accuracy for spatiotemporal data.

problem Scalability and accuracy trade-off in Neural Processes.
method Introduces KRBlocks, group-invariant attention biases, and BSA for scalable spatiotemporal inference.
result BSA-TNP matches or exceeds accuracy of best models while training faster.

Huisken and Sinestrari have recently defined a surgery process for mean curvature flow when the initial data is a two-convex hypersurface. The process depends on a parameter H. Its role is to initiate a surgery when the maximum of the mean curvature of the evolving hypersurface becomes H, and to control the scale at wh…

2010-02-19abs ↗pdf ↗

New method clusters directed graphs using Koopman operators.

problem Challenges in clustering directed graphs, especially complex eigenvalues and lack of cluster definition.
method Relate graph Laplacians to transfer operators and metastable sets in stochastic systems, derive clustering algorithms for directed and time-evolving graphs.
result Clusters can be interpreted as coherent sets, useful for analyzing transport and mixing processes.

Develops a new GLM framework for claims reserving with adaptive estimation.

problem Accurate assessment of claims reserves with dynamic and dependent claim activity.
method Multivariate evolutionary GLM framework with adaptive particle filtering algorithm.
result Adaptive estimation of evolving factors improves claims reserve accuracy.

New method clusters evolving networks using spatio-temporal graph Laplacian.

problem Clustering communities in time-varying graphs.
method Extends spectral clustering to dynamic graphs using CCA and spatio-temporal graph Laplacian.
result The spatio-temporal graph Laplacian clearly interprets cluster evolution over time.

This paper focuses on a class of linear Hawkes processes with general immigrants. These are counting processes with shot noise intensity, including self-excited and externally excited patterns. For such processes, we introduce the concept of age pyramid which evolves according to immigration and births. The virtue if t…

2015-04-24abs ↗pdf ↗

New RL method tackles dynamic MDPs with evolving rewards and states.

problem Dynamic MDPs with evolving rewards and states.
method Sliding Window Upper-Confidence bound for Reinforcement Learning (SWUCRL2-CW) and Bandit-over-Reinforcement Learning (BORL).
result Achieves dynamic regret bound for non-stationary MDPs.

In this thesis, we propose several modelling strategies to tackle evolving data in different contexts. In the framework of static clustering, we start by introducing a soft kernel spectral clustering (SKSC) algorithm, which can better deal with overlapping clusters with respect to kernel spectral clustering (KSC) and p…

2014-11-20abs ↗pdf ↗

We consider a zero-sum stochastic differential controller-and-stopper game in which the state process is a controlled diffusion evolving in a multi-dimensional Euclidean space. In this game, the controller affects both the drift and the volatility terms of the state process. Under appropriate conditions, we show that t…

2010-09-05abs ↗pdf ↗

In this paper, based on theories of complex adaptive systems, I argue that the main case for antitrust policy should be extended to include the criteria of "evolvability." To date, the main case focuses on economizing, including market power as a key filter for identifying suspect cases. Both production and transaction…

2012-03-06abs ↗pdf ↗

SGRNN models evolving graph data for better property prediction.

problem Modeling evolving graph data for property prediction.
method SGRNN uses stochastic latent variables to capture both node attribute and topology evolution, with semi-implicit variational inference and KL-divergence simplification.
result SGRNN improves property prediction on real-world datasets.

Massive volumes of high-dimensional data that evolves over time is continuously collected by contemporary information processing systems, which brings up the problem of organizing this data into clusters, i.e. achieve the purpose of dimensional deduction, and meanwhile learning its temporal evolution patterns. In this …

2019-10-19abs ↗pdf ↗

In this paper we use a time-evolving graph which consists of a sequence of graph snapshots over time to model many real-world networks. We study the path classification problem in a time-evolving graph, which has many applications in real-world scenarios, for example, predicting path failure in a telecommunication netw…

2019-05-10abs ↗pdf ↗

Develops a new class of forward performance processes for investment pools.

problem Investment performance in market models with continuous semimartingale stock prices.
method Constructs a broad class of forward performance processes with power mixture initial conditions.
result Characterizes and derives properties of two-power mixture forward performance processes.

Click-through rate~(CTR) prediction, whose goal is to estimate the probability of the user clicks, has become one of the core tasks in advertising systems. For CTR prediction model, it is necessary to capture the latent user interest behind the user behavior data. Besides, considering the changing of the external envir…

2018-09-11abs ↗pdf ↗

This work proposes a MFO framework for simultaneously evolving DQL models.

problem Complex DQL models struggle to converge to optimal policies due to exploration and sparse rewards.
method Combines meta-heuristic optimization, Transfer Learning, and DQL to automate knowledge transfer and policy learning.
result Framework automates knowledge transfer and policy learning of distributed RL agents.

In this note we study the optimal dividend problem for a company whose surplus process, in the absence of dividend payments, evolves as a generalized compound Poisson model in which the counting process is a generalized Poisson process. This model including the classical risk model and the Polya-Aeppli risk model as sp…

2013-05-08abs ↗pdf ↗

Communication networks have evolved from specialized, research and tactical transmission systems to large-scale and highly complex interconnections of intelligent devices, increasingly becoming more commercial, consumer-oriented, and heterogeneous. Propelled by emergent social networking services and high-definition st…

2012-11-29abs ↗pdf ↗

This paper demonstrates the use of genetic algorithms for evolving: 1) a grandmaster-level evaluation function, and 2) a search mechanism for a chess program, the parameter values of which are initialized randomly. The evaluation function of the program is evolved by learning from databases of (human) grandmaster games…

2017-11-21abs ↗pdf ↗

We study dynamics of a simulated world with stock and money, driven by the externally given processes which we refer to as sentiments. The considered sentiments influence the buy/sell stock trading attitude, the perceived price uncertainty, and the trading intensity of all or a part of the market participants. We study…

2017-05-19abs ↗pdf ↗

Establishes Calderón-Zygmund inequalities on evolving Riemannian manifolds.

problem Calderón-Zygmund inequalities on evolving Riemannian manifolds.
method Establishes various Calderón-Zygmund inequalities on evolving Riemannian manifolds with bounded curvature.
result Provides concrete applications of established inequalities.

This paper considers regression tasks involving high-dimensional multivariate processes whose structure is dependent on some {known} graph topology. We put forth a new definition of time-vertex wide-sense stationarity, or joint stationarity for short, that goes beyond product graphs. Joint stationarity helps by reducin…

2016-11-01abs ↗pdf ↗