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.

169,051 papers · 148 categories

Trend · papers per month

129257386514 · Jun 202019922001200920172026
48 results for unknown processes

A hybrid model combines physics and machine learning to predict unknown processes in numerical models.

problem Unknown or poorly represented processes in numerical models of the Earth System.
method Combining a physical model with a neural-net trained on observations.
result The hybrid model accurately predicts unknown processes with high correlation (close to 1).

A novel GPUM constructs Gaussian Processes for unknown manifolds with probabilistic metrics.

problem High-dimensional data on unknown manifolds with non-Euclidean geometry.
method Bayesian Gaussian Processes latent variable models (BGPLVM), Riemannian geometry, probabilistic metric tensor, Brownian Motion.
result GPUM provides more accurate predictions on unknown manifolds compared to traditional methods.

AI agent learns to handle unknown unknown states in reinforcement learning.

problem Handling unexpected, previously unseen states in reinforcement learning.
method Proposes EMDP-GA model with NIVE approach to expand value functions.
result Asymptotically consistent regret and comparable computational complexity.

A new GP framework for discovering unknown functions and hypergraph structure.

problem Discovering unknown functions and hypergraph structure in data.
method Interpretable Gaussian Process framework for Type 3 problems.
result Polynomial complexity for data-driven discovery of unknown functions and hypergraph structure.

Bayesian ODEs with Gaussian processes infer unknown dynamics from data.

problem Estimating unknown continuous-time system dynamics from data.
method Bayesian nonparametric model using Gaussian processes, sparse variational inference, probabilistic shooting.
result Posterior predictive uncertainty scores outperform alternative methods on multiple ODE learning tasks.

New BO method optimizes functions efficiently even with unknown hyperparameters.

problem Inaccurate estimation of Gaussian process hyperparameters degrades BO performance.
method Exploits multi-armed bandit and novel training loss function for consistent hyperparameter estimation.
result Sub-linear convergence to global optimum with unknown hyperparameters.

Identification of patterns from discrete data time-series for statistical inference, threat detection, social opinion dynamics, brain activity prediction has received recent momentum. In addition to the huge data size, the associated challenges are, for example, (i) missing data to construct a closed time-varying compl…

2018-11-02abs ↗pdf ↗

Study methods to recover unknown processes in PDEs from data.

problem Identifying unknown processes in time-dependent PDEs using observational data.
method Theoretical analysis and numerical approaches including Galerkin and collocation algorithms.
result The Galerkin algorithm is more suitable for practical situations with noisy data.

MAGI-X learns unknown dynamics from data without numerical integration.

problem Difficult to propose ODEs in closed-form for complex systems.
method MAGI-X uses neural networks within a manifold-constrained Gaussian process framework.
result MAGI-X achieves competitive accuracy in fitting and forecasting with reduced computational time.

GP-MRO discovers robust mixed strategies for unknown objectives.

problem Optimizing unknown objectives against worst-case uncertain parameters.
method Sequential learning from noisy point evaluations, combining online learning and Gaussian processes.
result GP-MRO finds robust mixed strategies that significantly improve performance over deterministic strategies.

The paper presents a method to infer unknown forcing functions in differential equations using Gaussian processes and adjoints.

problem Inferring unknown forcing functions in differential equations from noisy observations.
method Using adjoint methods to efficiently infer Gaussian process (GP) driven differential equations, with truncated basis expansions of the GP kernel.
result Efficient Bayesian inference of forcing functions modeled as GPs using adjoints, with lower computation than MCMC methods.

Develops robust MDPs for unknown disturbances with performance guarantees.

problem Unknown disturbance distribution in MDPs.
method Empirical distribution, sublevel set of distance function, weak convergence, concentration inequality.
result Robust optimal value function converges to true optimal value function with increasing sample sizes.

New algorithm achieves data-dependent regret bounds in MDPs with unknown transitions.

problem Achieving best-of-both-worlds guarantees with data-dependent regret bounds in MDPs with unknown transitions.
method Optimistic follow-the-regularized-leader algorithm with new optimistic Q-function estimators and transition bonus.
result First-order, second-order, and path-length bounds with polylog(T) regret in the stochastic regime.

New algorithm reduces online learning error for unknown feature distributions.

problem Oracle-efficient hybrid online learning with unknown feature and label distributions.
method Computational efficient online predictor using ERM oracle for finite-VC and fat-shattering classes.
result Oracle-efficient sublinear regret bounds for hybrid online learning with unknown feature generation.

Proposes a learned Bayesian Cramér-Rao bound for unknown measurement models.

problem Computing the Bayesian Cramér-Rao bound requires full knowledge of priors and measurement distributions.
method Introduces a Physics-encoded score neural network to learn priors and measurements.
result Demonstrates improved sample complexity and interpretability through domain knowledge incorporation.

Algorithm balances learning and coverage for multi-robots over unknown fields.

problem Balancing learning and coverage for multi-robots over unknown, nonuniform sensory fields.
method DSLC algorithm that schedules learning and coverage epochs, using Gaussian Process modeling and coverage regret analysis.
result Upper bound on expected cumulative coverage regret provided for DSLC.

Develops new e-processes and confidence sequences for Gaussian means with unknown variance.

problem Constructing valid t-tests and confidence sequences for Gaussian means with unknown variance.
method Explores generalized nonintegrable martingales and extended Ville's inequality, developing two new e-processes and confidence sequences.
result Analyzes the width of resulting confidence sequences with a polynomial dependence on error probability, proving it to be unavoidable and even better than classical fixed-sample t-tests.

We study a coupled system of controlled stochastic differential equations (SDEs) driven by a Brownian motion and a compensated Poisson random measure, consisting of a forward SDE in the unknown process X(t)X(t) and a \emph{predictive mean-field} backward SDE (BSDE) in the unknowns Y(t),Z(t),K(t,)Y(t), Z(t), K(t,\cdot). The driver of …

2015-05-19abs ↗pdf ↗

Safety filter for unknown discrete-time systems with learned models and noise covariance.

problem Ensuring safety for unknown discrete-time linear systems with Gaussian noise.
method Develops a learning-based safety filter using empirical model and noise covariance, optimizing control actions to stay within safety constraints.
result Minimally modifies nominal control actions to ensure safety with high probability, tightening constraints as more data is collected.

Bayesian model learns multiscale interactions in complex systems.

problem Understanding dynamic interplay between processes at different time scales.
method Bayesian learning framework with Particle Gibbs with Ancestor Sampling (PGAS) algorithm.
result Demonstrated the effectiveness of the proposed approach through simulations.

The paper uses Bayesian methods to infer hidden processes with unknown parameters.

problem Estimating hidden processes from noisy observations with unknown parameters.
method Variational Bayesian inference with autoregressive moving average (ARMA) and vector autoregressive (VAR) models, combined with sequential Monte Carlo (SMC) and importance sampling resampling (SISR).
result The proposed inference method accurately estimates hidden states from non-linear noisy observations.

Paper optimizes industrial refrigeration using adaptive exploration.

problem Challenges in optimizing real-time industrial processes with unknown characteristics and safety constraints.
method Adaptive and explorative real-time optimization framework with Gaussian process uncertainty quantification.
result Approach increases energy efficiency of refrigeration process, approximating complete information solutions.

Develops a new method for functional regression that works with non-Gaussian data.

problem Limited models for regression in function spaces with Gaussian process priors.
method Introduces Neural Operator Flows (OpFlow) for non-Gaussian function spaces.
result OpFlow enables robust and accurate uncertainty quantification for functional regression.

Nonparametric adaptive robust control tackles model uncertainty in stochastic processes.

problem Model uncertainty in stochastic processes.
method Adaptive robust control methodology using online learning and uncertainty reduction, empirical distribution, and Lagrangian duality.
result Nonparametric adaptive robust control approach is preferable to traditional robust frameworks.

Introduces a new stationary GE-process for gold price analysis.

problem Analyzing gold price data with a flexible stationary process.
method Developed a new stationary GE-process with three parameters. Analyzed synthetic and real gold price data.
result Maximum likelihood estimators can be obtained for the unknown parameters.

Algorithm optimizes decision-making in unknown MDPs with minimal regret.

problem Optimizing decision-making in unknown discrete MDPs with bounded expected shortest path.
method Developed BUCRL{} algorithm achieving ildeO(DSAT) ilde{\mathcal{O}}(\sqrt{DSAT}) regret.
result First polynomial time Bayesian algorithm for unknown MDPs with high probability worst-case regret.

In conventional ODE modelling coefficients of an equation driving the system state forward in time are estimated. However, for many complex systems it is practically impossible to determine the equations or interactions governing the underlying dynamics. In these settings, parametric ODE model cannot be formulated. Her…

2018-03-12abs ↗pdf ↗

Optimizes costs in uncertain Markov systems using risk filters.

problem Optimizing costs in systems with model uncertainty and unknown parameters.
method Risk filters and Bellman principle of optimality applied to Bayesian framework.
result Derives the Bellman principle for non-standard risk-averse control problems.

UCRL-V algorithm achieves optimal regret in unknown MDPs.

problem Optimizing reinforcement learning in unknown finite Markov decision processes.
method Empirical Bernstein inequalities for variance-based confidence intervals.
result Achieves optimal regret ildeO(DSAT) ilde{\mathcal{O}}(\sqrt{DSAT}) up to logarithmic factors.

New RL algorithm tackles adversarial RMAB with unknown transitions and bandit feedback.

problem Learning in episodic RMAB with unknown transition functions and adversarial rewards.
method Developed a novel RL algorithm with a biased reward estimator and an index policy.
result Achieved ildeO(HT) ilde{\mathcal{O}}(H\sqrt{T}) regret bound for adversarial RMAB.

Motivation: Cell-biological processes are regulated through a complex network of interactions between genes and their products. The processes, their activating conditions, and the associated transcriptional responses are often unknown. Organism-wide modeling of network activation can reveal unique and shared mechanisms…

2012-02-02abs ↗pdf ↗