Paper proves convergence of Markovian iteration for FBSDEs with fully coupled drift and Z process.
problem Proving convergence of Markovian iteration for FBSDEs with fully coupled drift and Z process.
method Differentiation-based approach to handle Z process, uniformly controlling Lipschitz continuity of decoupling fields.
result Proves convergence of Markovian iteration method for FBSDEs with fully coupled drift and Z process.
Deep learning solves non-Markovian FBSDEs for utility maximization.
problem Solving utility maximization problems under rough volatility.
method Deep learning-based numerical methods for non-Markovian fully coupled FBSDEs.
result Error estimates and convergence provided for the deep learning approach.
Lyapunov-based analysis shows polynomial sample complexity for WCMDPs and RBs.
problem Learning in WCMDPs and RBs under a generative model.
method Lyapunov-based analysis framework.
result Near-optimal policies can be learned with polynomial complexity.
Unified framework for Brownian motion distances on specific geometric manifolds.
problem Understanding Brownian motion distances on radially isoparametric manifolds.
method Developed a geometric framework and derived drift-window inequalities.
result Unified framework for coadapted Brownian couplings on RIM.
We propose a model of inter-bank lending and borrowing which takes into account clearing debt obligations. The evolution of log-monetary reserves of N banks is described by coupled diffusions driven by controls with delay in their drifts. Banks are minimizing their finite-horizon objective functions which take into a…
Statistic dynamics of financial systems is investigated, basing on a model of randomly coupled equation system driven by stochastic Langevin force. It is found that in stable regime the noise power spectrum of the system is of 1/f^alpha form, with the exponent alpha=3/2 in case of Hermitian coupling matrices, or slight…
Market impact game analyzed with stochastic parameters using FBSDEs.
problem Analyzing Nash equilibrium in a market impact game with stochastic parameters.
method Characterizes Nash equilibrium using fully coupled FBSDEs and provides conditions for their unique solution.
result Unique Nash equilibrium found and characterized in terms of FBSDEs.
Paper achieves ε−2 sample complexity for actor-critic methods with minimal assumptions.
problem Achieving ε−2 sample complexity for actor-critic methods under minimal assumptions. method Single-loop, single-timescale implementation; coupled Lyapunov drift framework.
result First ildeO(ε−2) sample complexity guarantee for finding an ε-optimal policy. Sharp eigenvalue bounds and splitting for modified Ricci flow.
problem Eigenvalue bounds and splitting in modified Ricci flow.
method Sharp lower bounds for eigenvalues of the drift Laplacian for a modified Ricci flow.
result Splitting theorem in the case of equality.
Motivated by a probabilistic approach to Kahler-Einstein metrics we consider a general non-equilibrium statistical mechanics model in Euclidean space consisting of the stochastic gradient flow of a given (possibly singular) quasi-convex N-particle interaction energy. We show that a deterministic "macroscopic" evolution…
SGLD proves geometric ergodicity via reflection coupling for nonconvex log-concave distributions.
problem Proving geometric ergodicity of SGLD in nonconvex, log-concave settings.
method Reflection coupling technique to handle SGLD's time discretization and minibatch issues.
result SGLD has an invariant distribution and geometric ergodicity in W1 distance. DRIFT uses RL to automate functional software testing efficiently.
problem Efficient and reliable automated software testing.
method DRIFT employs Q-learning with Graph Neural Networks on symbolic UI representations.
result DRIFT can robustly test software functionalities in a fully automated manner.
Classifying streaming data requires the development of methods which are computationally efficient and able to cope with changes in the underlying distribution of the stream, a phenomenon known in the literature as concept drift. We propose a new method for detecting concept drift which uses an Exponentially Weighted M…
We provide a verification and characterization result of optimal maximal sub-solutions of BSDEs in terms of fully coupled forward backward stochastic differential equations. We illustrate the application thereof in utility optimization with random endowment under probability and discounting uncertainty. We show with ex…
Paper proposes a weak approximation of reflection coupling for non-convex optimization.
problem Non-convex optimization problems with different drift terms.
method Proposes an approximate reflection coupling (ARC) for stochastic differential equations (SDEs).
result ARC converges weakly to the reflection coupling and can be applied to non-convex optimization.
Paper proposes a framework to detect adversarial concept drifts under poisoning attacks.
problem Adversarial concept drift in data streams.
method Augmented Restricted Boltzmann Machine with improved gradient computation and energy function.
result High robustness and efficacy of the proposed drift detection framework in adversarial scenarios.
This paper analyzes microstructure dynamics in coupled markets using CFMMs.
problem Quantifying contributions of CFMMs to market dynamics in coupled markets.
method Examined constant function market makers (CFMMs) in coupled markets, focusing on basket inflation/deflation.
result CFMMs contribute significantly to basket inflation/deflation in coupled markets.
New solutions found for elliptic systems with mixed couplings.
problem Existence of fully nontrivial solutions to elliptic systems with mixed couplings.
method Study of fully nontrivial solutions to the system with mixed couplings in a bounded or unbounded domain.
result New existence and multiplicity results of fully nontrivial solutions.
DDG-DA predicts future data distribution to adapt models for predictable concept drift.
problem Adapting models to streaming data with predictable concept drift.
method Train a predictor to forecast future data distribution, generate training samples, and train models on them.
result Significant improvement on multiple models in real-world tasks.
KOMET identifies Koopman operators from model parameter trajectories to adapt to evolving data distributions.
problem Adaptation of parametric models to non-stationary environments.
method Data-driven framework using Koopman operator identification and Extended Dynamic Mode Decomposition (EDMD).
result KOMET achieves high autonomous-rollout accuracies of 0.981 to 1.000 over 100 time steps on various drifting datasets.
Augmented bridge matching preserves coupling information between distributions.
problem Preserving the original empirical pairing in flow and bridge matching processes.
method Augmenting the velocity field with initial sample point information.
result Simple modification recovers coupling information without losing Markovian property.
Uniform bounds derived for fully non-linear equations.
problem Bounding fully non-linear equations uniformly in background metrics.
method Auxiliary Monge-Ampère equations and entropy-like quantities.
result Uniform L∞ bounds for systems coupling fully non-linear equations to their linearizations. Amazon SageMaker Model Monitor detects drift in deployed ML models.
problem Ensuring high performance of ML models in production environments.
method Automatically detects data, concept, bias, and feature attribution drift in real-time.
result Maintains high quality models by providing alerts and corrective actions.
A novel bootstrap method improves concept drift detection in predictive models.
problem Detecting changes in predictive relationships (concept drift) in data-driven applications.
method Developed a nested bootstrap procedure to calibrate control limits using the entire initial sample.
result The method yields more accurate baseline models and faster CL setup times.
This paper identifies drift Lipschitz budget K as key to diffusion policy expressivity and statistical trade-offs.
problem Understanding and maximizing the expressivity of diffusion policies while managing statistical limitations.
method Identifying drift Lipschitz budget K as central, quantifying expressivity and statistical behavior, proving lower bounds, and providing practical implementation guidelines.
result Balancing expressivity and statistical complexity yields a finite-sample performance gap, with rates depending on sample size and drift type.
This work presents a general unified theory for coupled nonlinear elastic and inelastic deformations of curved thin shells. The coupling is based on a multiplicative decomposition of the surface deformation gradient. The kinematics of this decomposition is examined in detail. In particular, the dependency of various ki…
This paper analyzes how multiple investors can exploit relative arbitrage opportunities.
problem Analyzing how multiple investors can exploit relative arbitrage opportunities.
method Constructing a well-posed market dynamical system of McKean-Vlasov type, deriving optimal strategies, and finding Nash equilibrium.
result The conditions for relative arbitrage opportunities among competitive investors are derived.
Geometric formalism views optimization algorithms as discrete connections, revealing their algebraic curvature and flatness properties.
problem Understanding and optimizing the behavior of iterative optimization algorithms.
method Introducing a geometric and operator-theoretic formalism where optimization algorithms are encoded by coupled channels (drift and diffusion) whose algebraic curvature measures the deviation from ideal reversibility.
result Flat connections correspond to methods whose updates commute up to higher order, achieving minimal numerical dissipation and preserving stability.
Transferring knowledge across many streaming processes remains an uncharted territory in the existing literature and features unique characteristics: no labelled instance of the target domain, covariate shift of source and target domain, different period of drifts in the source and target domains. Autonomous transfer l…
Discrete time analogues of ergodic stochastic differential equations (SDEs) are one of the most popular and flexible tools for sampling high-dimensional probability measures. Non-asymptotic analysis in the L2 Wasserstein distance of sampling algorithms based on Euler discretisations of SDEs has been recently develop…
Develops an algorithm for bilevel optimization with coupled constraints.
problem Challenges in bilevel optimization with coupled constraints.
method Primal-dual-assisted penalty approach and a fully first-order algorithm (BLOCC).
result Established rigorous convergence theory and demonstrated effectiveness on real-world applications.
Adaptive financial dataflow system improves model robustness in dynamic markets.
problem Static historical data leads to poor performance in dynamic financial markets.
method Drift-aware dataflow system with adaptive control and optimization.
result Enhanced model robustness and improved risk-adjusted returns.
A normalizing flow models a complex probability density as an invertible transformation of a simple base density. Flows based on either coupling or autoregressive transforms both offer exact density evaluation and sampling, but rely on the parameterization of an easily invertible elementwise transformation, whose choic…
D2SRM solves complex PDEs using deep learning.
problem High-dimensional, Hessian-dependent fully nonlinear parabolic PDEs.
method Single scalar space-time network generating derivative-consistent approximations trained through residuals and penalties.
result Well-posedness and convergence theory established for globally Lipschitz equations.
Federated Averaging (FedAvg) has emerged as the algorithm of choice for federated learning due to its simplicity and low communication cost. However, in spite of recent research efforts, its performance is not fully understood. We obtain tight convergence rates for FedAvg and prove that it suffers from `client-drift' w…
In this work, we leverage advances in sparse coding techniques to reduce the number of trainable parameters in a fully connected neural network. While most of the works in literature impose ℓ1 regularization, DropOut or DropConnect techniques to induce sparsity, our scheme considers feature importance as a criter…
A new method for conditional sampling using paired Wasserstein Autoencoders.
problem Conditional sampling from complex data distributions.
method Derive a novel loss function for Wasserstein Autoencoders to enable sampling from OT-type couplings.
result Learned cost-optimal transport maps and conditional sampling from an OT-type coupling.
Convolutional Neural Networks (CNNs) have become indispensable for solving machine learning tasks in speech recognition, computer vision, and other areas that involve high-dimensional data. A CNN filters the input feature using a network containing spatial convolution operators with compactly supported stencils. In pra…
Unified theory for optimal execution through signal-adaptive quotes in limit order books.
problem Optimal execution in limit order books with signal-dependent factors.
method Develops a unified solution theory for four execution criteria, incorporating signal-dependent drift, price impact, inventory risk, and execution risk.
result Explicit formulas reveal optimal quoting strategies and show signal-dependent drift can significantly affect execution.
In this paper, we study the non-linear diffusion equation associated with a particle system where the common drift depends on the rate of absorption of particles at a boundary. We provide an interpretation as a structural credit risk model with default contagion in a large interconnected banking system. Using the metho…
We analyse the optimal exercise of an executive stock option (ESO) written on a stock whose drift parameter falls to a lower value at a change point, an exponentially distributed random time independent of the Brownian motion driving the stock. Two agents, who do not trade the stock, have differing information on the c…
This paper shows how learning the phase-amplitude coupling improves bio-signal classification.
problem Discarding phase component in bio-signal feature extraction leads to poor generalization.
method Introducing a novel self-supervised learning task called Phase-Swap to detect phase-amplitude coupling.
result Neural networks trained on Phase-Swap task generalize better across subjects and recording sessions.
This paper provides guarantees for DFM models using KL divergence.
problem Ensuring generative models match target distributions efficiently.
method Using KL divergence and Brownian motion bridge for generative models.
result Non-asymptotic guarantees for DFM models under specific conditions.
Study investigates learning performance in inverse Ising problems with sparse teacher couplings.
problem Learning performance in inverse Ising problems with sparse teacher couplings.
method Pseudolikelihood maximization method, replica and cavity methods from statistical mechanics.
result Perfect inference of teacher's couplings is possible in the thermodynamic limit for certain conditions.
Online learning algorithms require to often recompute least squares regression estimates of parameters. We study improving the computational complexity of such algorithms by using stochastic gradient descent (SGD) type schemes in place of classic regression solvers. We show that SGD schemes efficiently track the true s…
Deep Reinforcement Learning (RL) recently emerged as one of the most competitive approaches for learning in sequential decision making problems with fully observable environments, e.g., computer Go. However, very little work has been done in deep RL to handle partially observable environments. We propose a new architec…
We consider a banking network represented by a system of stochastic differential equations coupled by their drift. We assume a core-periphery structure, and that the banks in the core hold a bubbly asset. The banks in the periphery have not direct access to the bubble, but can take initially advantage from its increase…
Improved growth strategies by incorporating stochastic factors in asset returns.
problem Drift uncertainty in asset returns makes growth optimization strategies sensitive.
method Study robust growth-optimization in high-dimensional incomplete markets under drift uncertainty and ergodicity.
result Utilizing stochastic factors improves robust growth rates and optimal strategies.