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

228457685913 · Jun 202019922001200920172026
48 results for dynamic design space

Two Bayesian optimization methods tackle dynamic design spaces with mixed variables.

problem Optimizing complex systems with varying numbers and types of variables and constraints.
method Two Bayesian optimization approaches: budget allocation and kernel function.
result Both methods converge faster and more consistently than standard approaches.

New RL approach learns dynamic VCG mechanisms in unknown MDP environments.

problem Learning dynamic VCG mechanisms in unknown MDP environments.
method Reward-free online RL for exploration, combined with function approximation.
result Regret bound of O~(T2/3)\tilde{\mathcal{O}}(T^{2/3}) for dynamic VCG mechanism learning.

New BED method handles online inference for partially observed dynamical systems.

problem Optimizing data collection for partially observable, partially online dynamical systems.
method Derived estimators of expected information gain and its gradient for SSMs, using nested particle filters.
result Successfully handles both partial observability and online inference in realistic models.

Algorithm learns optimal dynamic mechanisms from data.

problem Designing optimal mechanisms for dynamic settings with unknown reward functions.
method Offline reinforcement learning with pessimism principle.
result Learned mechanisms are efficient, individually rational, and truthful.

New technologies for recording the activity of large neural populations during complex behavior provide exciting opportunities for investigating the neural computations that underlie perception, cognition, and decision-making. Nonlinear state space models provide an interpretable signal processing framework by combinin…

2017-07-27abs ↗pdf ↗

Gradient-free framework for Bayesian experimental design in complex systems.

problem Optimal experimental design in systems where gradient information is unavailable.
method Combines EKI and ALDI for optimization and sampling, with approximations for scalable utility estimation.
result Demonstrates robust, accurate, and efficient experimental design in various complex systems.

We propose a new approach to solve optimal stopping problems via simulation. Working within the backward dynamic programming/Snell envelope framework, we augment the methodology of Longstaff-Schwartz that focuses on approximating the stopping strategy. Namely, we introduce adaptive generation of the stochastic grids an…

2013-09-16abs ↗pdf ↗

Optimizes hydrokinetic turbine design using morphing and Bayesian optimization.

problem Designing optimal hydrokinetic turbine shapes due to high cost and geometric constraints.
method Design-by-Morphing (DbM) and Mixed variable, Multi-Objective Bayesian Optimization (MixMOBO).
result Optimized shapes lead to maximum power output with minimal evaluations.

Bayesian approach for learning spatiotemporal systems from noisy data.

problem Efficiently modeling and learning from spatiotemporal dynamical systems with noisy data.
method Hierarchical state-space models with Gaussian process regression for efficient interpolation and training.
result Efficient modeling and learning of spatiotemporal dynamics using Bayesian methods.

The paper introduces Causal Neural Operators to approximate operators in stochastic analysis.

problem Leveraging temporal structure in non-linear operators for deep learning models.
method Designing a deep learning model framework for infinite-dimensional linear metric spaces.
result Causal Neural Operators can uniformly approximate Hölder or smooth trace class operators.

Network representation learning in low dimensional vector space has attracted considerable attention in both academic and industrial domains. Most real-world networks are dynamic with addition/deletion of nodes and edges. The existing graph embedding methods are designed for static networks and they cannot capture evol…

2018-12-06abs ↗pdf ↗

Persistent homology provides a new, efficient molecular descriptor for protein dynamics.

problem Designing effective molecular descriptors for high-dimensional MD trajectories.
method Introduced masked Flood complex, a protein-tailored modification of simplicial complexes, for persistent homology.
result Persistent homology-based descriptors are competitive across protein dynamics tasks, including frame-level observable regression and MSM estimation.

Efficiently selects top-m designs for various contexts using sequential sampling.

problem Optimizing selection of top-m designs across different contexts.
method Formulated as a stochastic dynamic programming problem, developed sequential sampling policy.
result Asymptotically optimal sampling ratios for efficient selection.

Many dynamical systems exhibit similar structure, as often captured by hand-designed simplified models that can be used for analysis and control. We develop a method for learning to correspond pairs of dynamical systems via a learned latent dynamical system. Given trajectory data from two dynamical systems, we learn a …

2019-12-06abs ↗pdf ↗

Despite the numerous advances, reinforcement learning remains away from widespread acceptance for autonomous controller design as compared to classical methods due to lack of ability to effectively tackle the reality gap. The reliance on absolute or deterministic reward as a metric for optimization process renders rein…

2019-06-03abs ↗pdf ↗

Despite the phenomenal success of deep learning in recent years, there remains a gap in understanding the fundamental mechanics of neural nets. More research is focussed on handcrafting complex and larger networks, and the design decisions are often ad-hoc and based on intuition. Some recent research has aimed to demys…

2019-04-24abs ↗pdf ↗

Unified framework for robust A/B testing under model misspecification.

problem Improving sample efficiency in A/B testing with model misspecification.
method Unified framework for contextual bandit and dynamic settings, proving worst-case mean squared error bounds.
result Empirically validated approach using synthetic and real-world datasets.

New method uses neural nets in Hilbert space for option pricing on flow forwards.

problem Pricing options on flow forwards with neural networks in Hilbert space.
method Optimization problem in Hilbert space solved by a novel feedforward neural network architecture.
result Excellent numerical efficiency and superior performance over classical methods.

We investigate two new strategies for the numerical solution of optimal stopping problems within the Regression Monte Carlo (RMC) framework of Longstaff and Schwartz. First, we propose the use of stochastic kriging (Gaussian process) meta-models for fitting the continuation value. Kriging offers a flexible, nonparametr…

2015-09-07abs ↗pdf ↗

Learning workable representations of dynamical systems is becoming an increasingly important problem in a number of application areas. By leveraging recent work connecting deep neural networks to systems of differential equations, we propose \emph{variational integrator networks}, a class of neural network architecture…

2019-10-21abs ↗pdf ↗

Value functions struggle to represent transition dynamics, impacting statistical efficiency.

problem Limited representational power of value functions in capturing transition dynamics.
method Case studies of various reinforcement learning problems to explore the limitations of value-based methods.
result Value-based methods can be as efficient as model-based ones in some cases but severely underperform in others due to information loss.

This paper introduces a new neural ODE model for continuous-time sequence generation.

problem Representing and predicting continuous-time sequences with high accuracy.
method A neural emission model and neural ODE define the latent state evolution, with an Energy-based model for prior distribution.
result The model outperforms existing methods in various tasks, including long-horizon predictions.

Model learns Lagrangian dynamics from images for better prediction and control.

problem Lack of interpretability and applicability to high-dimensional data like images.
method Unsupervised neural network model that learns Lagrangian dynamics from images using a coordinate-aware VAE.
result Model infers interpretable Lagrangian dynamics, enabling long-term prediction and synthesis of controllers.

DaringFed incentivizes clients in OFL with dynamic rewards under TII.

problem Designing incentives for OFL clients under dynamic, incomplete information.
method Formulated as a dynamic signaling and pricing allocation problem in a Bayesian persuasion game.
result Optimal design of DaringFed improves accuracy and convergence speed by 16.99%.

The paper proposes a method to identify causal structure in complex dynamical systems.

problem Spurious correlations in data-driven models limit the performance of control systems.
method The method leverages controllability concepts to compute input trajectories and uses causal inference techniques.
result The method reliably identifies the true causal structure of control systems from real-world data.

This paper introduces a new specialized algorithm for equilibrium Monte Carlo sampling of binary-valued systems, which allows for large moves in the state space. This is achieved by constructing self-avoiding walks (SAWs) in the state space. As a consequence, many bits are flipped in a single MCMC step. We name the alg…

2011-11-23abs ↗pdf ↗

Reinforcement learning would enjoy better success on real-world problems if domain knowledge could be imparted to the algorithm by the modelers. Most problems have both hidden state and unknown dynamics. Partially observable Markov decision processes (POMDPs) allow for the modeling of both. Unfortunately, they do not p…

2012-12-12abs ↗pdf ↗

Paper proposes a new method to optimize robot body structure and control policy.

problem Optimizing robot body structure and control policy in a coupled manner.
method Revisits co-design problem as a Stackelberg game, incorporating control adaptation dynamics.
result Stackelberg PPO outperforms standard PPO in stability and performance.

Meta-learning improves drone trajectory design for dynamic wireless networks.

problem Designing optimal trajectories for energy-constrained drones in dynamic network environments.
method Proposes a meta-learning algorithm to adaptively tune a reinforcement learning solution for trajectory design.
result Meta-tuned RL yields faster convergence and improved communication performance compared to baseline algorithms.

New method designs antimicrobial peptides with high potency and low toxicity.

problem Designing potent antimicrobial drugs with low toxicity.
method CLaSS method using deep generative autoencoder and atomistic simulations.
result Design and synthesis of two novel AMPs with high potency and low toxicity.

The present paper proposes a unified geometric framework for coordinated motion on Lie groups. It first gives a general problem formulation and analyzes ensuing conditions for coordinated motion. Then, it introduces a precise method to design control laws in fully actuated and underactuated settings with simple integra…

2008-07-28abs ↗pdf ↗