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,657 papers · 148 categories

Trend · papers per month

63127190253 · Jun 202019922001200920172026
48 results for adaptive thermostat

Improved stability for large-scale Bayesian sampling.

problem Reducing instability in Langevin dynamics for large datasets.
method Introducing a modified CCAdL thermostat with a scaling and squaring method and a truncated Taylor series approximation.
result Significantly improved numerical stability and accuracy over existing methods.

The paper studies ray transforms on surfaces with negative curvature, proving injectivity and determining connections and Higgs fields.

problem Injectivity of ray transforms on surfaces with negative curvature and determination of connections and Higgs fields.
method Analysis of Gaussian thermostats on compact Riemannian surfaces with negative curvature, proving injectivity and determining connections and Higgs fields.
result Injectivity of the thermostat ray transform and determination of connections and Higgs fields.

Researchers study injectivity of magnetic and thermostatic nonabelian ray transforms on compact surfaces.

problem Injectivity of magnetic and thermostatic nonabelian ray transforms on compact surfaces.
method Loop group factorization method for nontrapping λλ-geodesic flows and the general linear group of invertible complex matrices.
result General injectivity question of the nonabelian ray transform for simple magnetic flows is settled.

We introduce a new family of thermostat flows on the unit tangent bundle of an oriented Riemannian 22-manifold. Suitably reparametrised, these flows include the geodesic flow of metrics of negative Gauss curvature and the geodesic flow induced by the Hilbert metric on the quotient surface of divisible convex sets. We …

2017-06-12abs ↗pdf ↗

We consider a general family of curves ΓΓ on a compact oriented Finsler surface (M,F)(M,F) with boundary M\partial M. Let φC(M)\varphi\in C^{\infty}(M) and ωω a smooth 1-form on MM. We show that γ(t){φ(γ(t))+ωγ(t)(γ˙(t))}dt=0\int_{γ(t)}\{\varphi(γ(t))+ω_{γ(t)}(\dotγ(t))\}\,dt=0 holds for every γΓγ\inΓ whose endpoints belong to M\partial M, $γ(a)…

2012-04-19abs ↗pdf ↗

We use online convex optimization (OCO) for setpoint tracking with uncertain, flexible loads. We consider full feedback from the loads, bandit feedback, and two intermediate types of feedback: partial bandit where a subset of the loads are individually observed and the rest are observed in aggregate, and Bernoulli feed…

2017-09-12abs ↗pdf ↗

A new hierarchy quantifies agency in systems based on information processing.

problem Lack of a measurable, universal definition for agency in intelligent systems.
method Developed a bottom-up framework based on information processing hierarchy.
result Identified three orders of information processing (I, II, III) as necessary for agency.

Bayesian max-margin models have shown superiority in various practical applications, such as text categorization, collaborative prediction, social network link prediction and crowdsourcing, and they conjoin the flexibility of Bayesian modeling and predictive strengths of max-margin learning. However, Monte Carlo sampli…

2015-04-27abs ↗pdf ↗

Hamiltonian Monte Carlo (HMC) is an efficient Bayesian sampling method that can make distant proposals in the parameter space by simulating a Hamiltonian dynamical system. Despite its popularity in machine learning and data science, HMC is inefficient to sample from spiky and multimodal distributions. Motivated by the …

2019-12-04abs ↗pdf ↗

AdaPTS adapts univariate FMs for multivariate time series forecasting.

problem Challenges in managing feature dependencies and uncertainty quantification in multivariate time series forecasting.
method Adapters that transform multivariate inputs into a latent space and apply univariate FMs independently to each dimension.
result AdaPTS enhances forecasting accuracy and uncertainty quantification compared to baseline methods.

Adaptive sequential decision making is one of the central challenges in machine learning and artificial intelligence. In such problems, the goal is to design an interactive policy that plans for an action to take, from a finite set of nn actions, given some partial observations. It has been shown that in many applicat…

2019-11-09abs ↗pdf ↗

New algorithm reduces interventional strategy complexity for causal graph discovery.

problem Designing efficient interventional strategies for causal graph discovery.
method Developed an r-adaptive algorithm for causal graph discovery that minimizes the number of interventions.
result Achieved an approximation of O(min{r, log n} * n^{1/min{r, log n}}) for the verification number.

Automation of machine learning model development is increasingly becoming an established research area. While automated model selection and automated data pre-processing have been studied in depth, there is, however, a gap concerning automated model adaptation strategies when multiple strategies are available. Manually…

2018-12-27abs ↗pdf ↗

Adaptive variational Bayes framework improves inference adaptively.

problem Lack of general and computationally tractable variational Bayes method for adaptive inference.
method Proposes a novel adaptive variational Bayes framework combining variational posteriors over individual models.
result Adaptive variational Bayes achieves optimal contraction rates adaptively under general conditions.

This paper improves neural network generalization by dynamically learning kernel parameters.

problem Improving neural network generalization and adaptability.
method Diagonal adaptive kernel model that learns kernel eigenvalues and output coefficients during training.
result The diagonal adaptive kernel model significantly improves generalization over fixed-kernel methods.

Study on distributed nonparametric function estimation with optimal rate and cost of adaptation.

problem Optimal rate of convergence and cost of adaptation in distributed nonparametric function estimation.
method Distributed minimax estimation and adaptive estimation under communication constraints for Gaussian sequence model and white noise model.
result Established minimax rate of convergence and exact communication cost for adaptation.

This paper explains why Adam generalizes worse than SGD by analyzing its components.

problem Understanding why Adam generalizes worse than Stochastic Gradient Descent (SGD).
method Diffusion theoretical framework to disentangle the effects of Adaptive Learning Rate and Momentum.
result Adaptive Learning Rate helps escape saddle points but not select flat minima, while Momentum provides a drift effect to help pass through saddle points.

Adaptive networks improve model robustness through conditional normalization.

problem Limited robustness of adversarial-trained networks due to network capacity and training samples.
method Proposes a conditional normalization module to adapt networks during adversarial training.
result Adaptive networks outperform both clean validation accuracy and robustness compared to non-adaptive counterparts.

In domain adaptation, classifiers with information from a source domain adapt to generalize to a target domain. However, an adaptive classifier can perform worse than a non-adaptive classifier due to invalid assumptions, increased sensitivity to estimation errors or model misspecification. Our goal is to develop a doma…

2017-06-25abs ↗pdf ↗

FLAP adapts policies quickly to new tasks using shared linear representations.

problem Adapting policies to new tasks efficiently and effectively.
method FLAP uses a shared linear representation and a separate adapter network for quick adaptation.
result FLAP achieves up to 8X faster adaptation and significantly better performance on out-of-distribution tasks.

Learn to automatically plug domain-specific modules into a common network.

problem Learning inflexibility and computational intensiveness in multi-domain learning.
method Neural Architecture Search (NAS) for data-driven adapter plugging and structure design.
result NAS-driven MDL model achieves comparable performance to existing approaches.

FLoE adapts LLMs by selectively deploying LoRA adapters based on layer importance and task requirements.

problem Uniform LoRA deployment across all layers leads to inefficient and redundant parameter allocation.
method FLoE uses Fisher information to dynamically identify task-critical layers and optimizes LoRA ranks.
result FLoE achieves significant efficiency-accuracy trade-offs, especially in resource-constrained environments.

New protocols show 1-bit mean estimation can be order-optimal without interaction.

problem Can 1-bit mean estimation be optimal without interaction?
method Adaptive and non-adaptive threshold and interval queries, with one adaptive transition.
result Arbitrary non-adaptive quantizers can match the adaptive rate, suggesting interaction is not necessary.

AdapTable adapts tabular models to shifts without source data, improving HELOC performance.

problem Distribution shifts in tabular data threaten model performance.
method Shift-aware uncertainty calibrator and label distribution handler.
result Up to 16% improvement on HELOC dataset.