The problem of optimizing unknown costly-to-evaluate functions has been studied for a long time in the context of Bayesian Optimization. Algorithms in this field aim to find the optimizer of the function by asking only a few function evaluations at locations carefully selected based on a posterior model. In this paper,…
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,742 papers · 148 categories
Trend · papers per month
48 results for “phase space exploration”
Maximizes Rényi entropy for efficient exploration in reward-free RL.
problem Challenges of exploration in reward-free reinforcement learning.
method Maximizes Rényi entropy over state-action space in exploration phase; uses batch RL for planning phase.
result Effective and sample-efficient exploration leading to superior policies.
New algorithm reduces regret by allowing free exploration in multi-armed bandits.
problem Designing an adaptive policy to minimize regret with a free exploration budget.
method Introduced -probably saving policies and a two-phase algorithm UFE-KLUCB-H.
result UFE-KLUCB-H accumulates strictly less regret than non-free exploration policies.
The paper connects -manifolds to Coulomb and Higgs phases of gauge theories.
problem Exploring the physical interpretation of special singularities in -holonomy manifolds.
method Analyzing desingularizations of orbifold singularities and relating them to gauge theories.
result Shows an isomorphism between moduli spaces of Ricci flat metrics and flat ADE-connections.
Consensus-based adaptive sampling and approximation for high-dimensional energy landscapesphysics.comp-ph
Unified framework for sampling and approximating high-dimensional energy landscapes.
problem Sampling and approximating complex energy landscapes in physical systems with constraints and energy barriers.
method Formulates a minimax optimization problem that jointly adapts surrogate approximation and adaptive sampling.
result Demonstrates effectiveness in biomolecular systems with up to 30 collective variables.
New tan-concavity property for Lagrangian phase operators helps in studying dHYM metrics.
problem Lack of concavity in Lagrangian phase operator for dHYM metrics.
method Introduce tangent Lagrangian phase flow (TLPF) on almost calibrated (1,1)-forms.
result TLPF exists for all positive time and converges to dHYM metrics under certain conditions.
The aim of this work is to explore the possible types of phenomena that simple macroeconomic Agent-Based models (ABM) can reproduce. We propose a methodology, inspired by statistical physics, that characterizes a model through its 'phase diagram' in the space of parameters. Our first motivation is to understand the lar…
We present a new model-based algorithm for reinforcement learning (RL) which consists of explicit exploration and exploitation phases, and is applicable in large or infinite state spaces. The algorithm maintains a set of dynamics models consistent with current experience and explores by finding policies which induce hi…
In this paper we explore the idea of looking at the Dirac quantisation conditions as -dependent constraints on the tangent bundle to phase-space. Starting from the path-integral version of classical mechanics and using the natural Poisson brackets structure present in the cotangent bundle to the tangent bundle o…
A new liquid crystalline texture is proposed using gnomonic projection of the Hopf fibration.
problem Creating bend-free textures in flat space from 3-sphere Hopf fibration.
method Geodesic-preserving gnomonic projection of the Hopf fibration.
result A new liquid crystalline phase with only splay and twist.
Moduli spaces of doubly periodic monopoles, also called monopole walls or monowalls, are hyperkähler; thus, when four-dimensional, they are self-dual gravitational instantons. We find all monowalls with lowest number of moduli. Their moduli spaces can be identified, on the one hand, with Coulomb branches of five-dimens…
Optimizes biomolecular simulations by ranking adaptive sampling policies.
problem Efficiently sampling biomolecular systems to capture complex dynamical behaviors.
method Metric-driven ranking of adaptive sampling policies to identify the optimal policy for each round.
result Different adaptive sampling policies lead to faster convergence and improved sampling performance.
New K-theory approach classifies anyonic topological phases in 2D semimetals.
problem Classifying interacting topological phases remains open.
method TED K-theory of configuration spaces of points in the Brillouin torus.
result Classifies su(2)-anyonic topological order in 2D semimetals.
In this work, we use the Sternberg phase space (which may be considered as the classical phase space of particles in gauge fields) in order to explore the dynamics of such particles in the context of Hamilton-Dirac systems and their associated Hamilton-Pontryagin variational principles. For this, we develop an analogue…
New algorithm for RL with horizon-free reward-free exploration for linear MDPs.
problem Reward-free reinforcement learning with long planning horizons.
method Uncertainty-weighted value-targeted regression with exploration-driven pseudo-reward and moment estimator.
result Horizon-free sample complexity of for finding an -optimal policy.
A bandit algorithm reduces regret in noisy, communication-constrained feedback.
problem Distributed stochastic multi-armed bandit with noisy, communication-constrained feedback.
method Proposes a multi-phase bandit algorithm, UE-UCB++, that matches an information-theoretic lower bound.
result Matches an information-theoretic lower bound of Ω(√(KT/σ²)) on the minimax regret.
A new method learns to stop with minimal data, outperforming traditional approaches.
problem Optimal stopping problems with unknown distributions.
method Explore-then-exploit approach with logarithmic exploration phase.
result Performance comparable to full information DP solution with minimal exploration.
DETC algorithm achieves asymptotic optimality in multi-armed bandit problems.
problem Multi-armed bandit problem with subgaussian rewards.
method DETC algorithm with two exploration and exploitation phases.
result DETC achieves asymptotically optimal regret bound.
E2C separates planning and execution in LLMs, improving efficiency and performance.
problem Entangled planning and execution in LLMs waste tokens and limit flexibility.
method E2C splits exploration and execution phases, using SFT and RL for training.
result E2C achieves 53.3% accuracy on AIME'2024 with 12.4k tokens, outperforming alternatives.
Phase Transitions in Operational Riskphysics.soc-ph
In this paper we explore the functional correlation approach to operational risk. We consider networks with heterogeneous a-priori conditional and unconditional failure probability. In the limit of sparse connectivity, self-consistent expressions for the dynamical evolution of order parameters are obtained. Under equil…
Surface tension of multi-phase flow with multiple junctions governed by the variational principlemath.NA
We explore a computational model of an incompressible fluid with a multi-phase field in three-dimensional Euclidean space. By investigating an incompressible fluid with a two-phase field geometrically, we reformulate the expression of the surface tension for the two-phase field found by Lafaurie, Nardone, Scardovelli, …
Hypothesis testing is an important problem with applications in target localization, clinical trials etc. Many active hypothesis testing strategies operate in two phases: an exploration phase and a verification phase. In the exploration phase, selection of experiments is such that a moderate level of confidence on the …
Robust algorithm optimizes corrupted Gaussian process bandits.
problem Sequential optimization of corrupted, expensive reward functions.
method Robust GP Phased Elimination (RGP-PE) algorithm.
result Algorithm balances robustness to corruptions with exploration and exploitation.
New method uses generative models to improve phase retrieval stability.
problem Improving stability of solutions in phase retrieval problems.
method Unified reconstruction approach using generative models to mitigate overfitting.
result Mitigates overfitting to generative model for varying noise levels.
Anomalous diffusion in SGD reveals interactions between hyperparameters and Hessian.
problem Understanding the limiting dynamics of SGD in deep neural networks.
method Continuous-time model of SGD as an underdamped Langevin equation, derived for linear regression.
result Anomalous diffusion is explained by modified loss and probability currents in phase space.
PBCS combines RL and motion planning for better exploration.
problem RL algorithms struggle with versatile exploration in complex environments.
method PBCS uses motion planning to find a good trajectory, then trains RL on a curriculum derived from it.
result PBCS outperforms state-of-the-art RL algorithms in 2D maze environments.
The paper models market crashes as phase transitions, finding dynamic transitions offer better predictions.
problem Understanding and predicting extreme financial events like market crashes.
method Employing phase transition theory, focusing on endogenous crashes, and comparing DPT, CPT, and SPT.
result Dynamic phase transitions provide more accurate predictions of market crashes compared to critical and stochastic models.
There are two variants of the classical multi-armed bandit (MAB) problem that have received considerable attention from machine learning researchers in recent years: contextual bandits and simple regret minimization. Contextual bandits are a sub-class of MABs where, at every time step, the learner has access to side in…
The big phase space, the geometric setting for the study of quantum cohomology with gravitational descendents, is a complex manifold and consists of an infinite number of copies of the small phase space. The aim of this paper is to define a Hermitian geometry on the big phase space. Using the approach of Dijkgraaf and …
New algorithm learns policies without explicit rewards for MDPs.
problem Learning policies for MDPs without explicit rewards.
method UCRL-RFE algorithm with linear function approximation.
result UCRL-RFE achieves optimal policy with minimal exploration samples.
This paper proposes an approach to the joint modeling of the short-time Fourier transform magnitude and phase spectrograms with a deep generative model. We assume that the magnitude follows a Gaussian distribution and the phase follows a von Mises distribution. To improve the consistency of the phase values in the time…
Data-driven approach learns effective equations for phase field interfaces.
problem Learning accurate equations for phase field interface dynamics.
method Data-driven identification of partial differential equations from phase field data.
result Data-driven equations outperform analytical approximations in certain regimes.
Symplectic forms from two phase spaces are proven equivalent.
problem Equivalence of symplectic forms from different phase spaces.
method Proof of equivalence for theories over space-time with boundary.
result Symplectic forms derived from canonical and covariant phase spaces are equivalent.
A new deep learning model improves phase retrieval performance.
problem Recovering signals from phaseless measurements.
method Hybrid model-based data-driven deep architecture (Unfolded Phase Retrieval, UPR).
result Significant improvement in phase retrieval performance.
The phase space of relativistic particle mechanics is defined as the 1st jet space of motions regarded as timelike 1-dimensional submanifolds of spacetime. A Lorentzian metric and an electromagnetic 2-form define naturally on the odd-dimensional phase space a generalized contact structure. In the paper infinitesimal sy…
Deep learning has become an area of interest in most scientific areas, including physical sciences. Modern networks apply real-valued transformations on the data. Particularly, convolutions in convolutional neural networks discard phase information entirely. Many deterministic signals, such as seismic data or electrica…
This paper presents the Speech Technology Center (STC) systems submitted to Automatic Speaker Verification Spoofing and Countermeasures (ASVspoof) Challenge 2015. In this work we investigate different acoustic feature spaces to determine reliable and robust countermeasures against spoofing attacks. In addition to the c…
New method uses image registration to recover complex signals from amplitude data.
problem Recovering complex-valued signals from amplitude measurements.
method Indirect registration using LDDMM formalism with exterior calculus.
result Algorithm performs well under various conditions including noise and topology.
AgABC improves ABC algorithm by balancing exploration and exploitation.
problem Balancing global and local search abilities in ABC algorithm.
method Divide population into groups and assign different search strategies to members.
result Proposed AgABC algorithm outperforms other algorithms in accuracy and stability.
Paper eliminates warm-up phase for PO in linear MDPs, achieving optimal regret.
problem Costly warm-up phase in PO algorithms for linear MDPs.
method Simple contraction mechanism replaces warm-up phase.
result Achieves rate-optimal regret with improved dependence on problem parameters.
Modeling a Financial System with Memory via Fractional Calculus and Fractional Brownian Motionq-fin.ST
Modeling financial markets with memory using fractional calculus and Brownian motion.
problem Capturing memory effects in financial markets using stochastic models.
method Fractional Langevin equation with colored noise generated by fractional Brownian motion.
result Anomalous marginal glass phase observed in some regions of the system.
Minimizing non-convex and high-dimensional objective functions is challenging, especially when training modern deep neural networks. In this paper, a novel approach is proposed which divides the training process into two consecutive phases to obtain better generalization performance: Bayesian sampling and stochastic op…
New method for flux quantization on phase space stacks.
problem Defining and constructing flux-quantized phase space stacks.
method Observation of flux densities and characterization of Cauchy data.
result Flux-quantized phase space stacks have classifying spaces with rational Whitehead L-infinity algebra.
Particle Metropolis-Hastings (PMH) allows for Bayesian parameter inference in nonlinear state space models by combining Markov chain Monte Carlo (MCMC) and particle filtering. The latter is used to estimate the intractable likelihood. In its original formulation, PMH makes use of a marginal MCMC proposal for the parame…
Deep Learning Reconstruction of Ultra-Short Pulsesphysics.optics
Ultra-short laser pulses with femtosecond to attosecond pulse duration are the shortest systematic events humans can create. Characterization (amplitude and phase) of these pulses is a key ingredient in ultrafast science, e.g., exploring chemical reactions and electronic phase transitions. Here, we propose and demonstr…
Introduces a new phase space for 2D supersymmetric sigma models.
problem Developing a new Hamiltonian formulation for 2D supersymmetric sigma models.
method Introduces a phase space with spinorial momenta and derives a covariant Hamiltonian formulation.
result Shows the existence of additional supersymmetries in the new formulation.
Study uncovers new phase transitions in asymmetric causal inference scenarios.
problem Understanding typical phase transitions in asymmetric causal inference.
method Combining Causal inference (C-inf) and Low-rank recovery (LRR) with Random duality - Free probability theory (RDT-FPT).
result Discovering a doubling low-rankness phenomenon in asymmetric scenarios.
Safe exploration in RF-RL doesn't increase sample complexity.
problem Achieving optimal policies with safety constraints in reward-free RL.
method Proposed SWEET framework for tabular and low-rank MDP settings, leveraging truncated value functions.
result Sample complexities match or outperform constraint-free counterparts, proving safety constraints have little impact.