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

112223335446 · Jun 202019922001200920172026
48 results for adaptive coordinate transformations

New Hermite approximations accelerate convergence with adaptive coordinate transformations.

problem Accelerating convergence of spectral approximations for Hermite expansions.
method Using normalizing flows for adaptive coordinate transformations and deriving error estimates.
result Error estimates for Hermite expansions under adaptive coordinate transformations.

LOFT separates subspace rotation and transformation for orthogonal fine-tuning.

problem Conflating subspace rotation and transformation in orthogonal fine-tuning.
method LOFT explicitly separates subspace rotation and transformation, using task-aware support selection.
result LOFT recovers principal-subspace orthogonal adaptation and improves efficiency-performance trade-off.

Proposes a neural network method to correct residual distortions in coordinate transformations.

problem Nonlinear and spatially dependent distortions in coordinate transformation models.
method Residual-based neural network approach focusing on systematic distortions.
result The method improves accuracy and stability in challenging conditions.

Solves problem of describing transformations for upper triangular Toeplitz operators.

problem Describing coordinate transformations preserving upper triangular Toeplitz form of operator fields.
method Implicit formulas involving matrix-valued functions for describing transformations and Nijenhuis operators.
result Formulas for coordinate transformations and Nijenhuis operators in upper triangular Toeplitz form.

Coordinate descent (CD) algorithms have become the method of choice for solving a number of optimization problems in machine learning. They are particularly popular for training linear models, including linear support vector machine classification, LASSO regression, and logistic regression. We consider general CD with …

2014-01-15abs ↗pdf ↗

We discuss results for the Ribaucour transformation of curves or of higher dimensional smooth and discrete submanifolds. In particular, a result for the reduction of the ambient dimension of a submanifold is proved and the notion of Ribaucour coordinates is derived using a Bianchi permutability result. Further, we disc…

2017-11-13abs ↗pdf ↗

Natural coordinates for SL3-webs on surfaces are shown to be consistent under triangulation changes.

problem Natural coordinates for SL3-webs on surfaces.
method Showed natural coordinates are consistent under triangulation changes using cluster transformations.
result Natural coordinates for SL3-webs on surfaces are consistent under triangulation changes.

A generalization of exterior calculus is considered by allowing the partial derivatives in the exterior derivative to assume fractional orders. That is, a fractional exterior derivative is defined. This is found to generate new vector spaces of finite and infinite dimension, fractional differential form spaces. The def…

2003-01-10abs ↗pdf ↗

Motivated by black hole physics in N=2, D=4 supergravity, we study the geometry of quaternionic-Kahler manifolds M obtained by the c-map construction from projective special Kahler manifolds M_s. Improving on earlier treatments, we compute the Kahler potentials on the twistor space Z and Swann space S in the complex co…

2007-01-23abs ↗pdf ↗

This paper introduces AdaSDCA: an adaptive variant of stochastic dual coordinate ascent (SDCA) for solving the regularized empirical risk minimization problems. Our modification consists in allowing the method adaptively change the probability distribution over the dual variables throughout the iterative process. AdaSD…

2015-02-27abs ↗pdf ↗

Discrete conjugate systems are quadrilateral nets with all planar faces. Discrete orthogonal systems are defined by the additional property of all faces being concircular. Their geometric properties allow one to consider them as proper discretization of conjugate, resp. orthogonal coordinate systems of classical differ…

2003-03-26abs ↗pdf ↗

CMC-1 surfaces linked via Möbius transformations between circle patterns.

problem Characterizing and relating CMC-1 surfaces via circle patterns.
method Osculating Möbius transformations between circle patterns induce realizations in hyperbolic space.
result One-to-one correspondence between CMC-1 surfaces under specific conditions.

We present the notion of a filtered bundle as a generalisation of a graded bundle. In particular, we weaken the necessity of the transformation laws for local coordinates to exactly respect the weight of the coordinates by allowing more general polynomial transformation laws. The key examples of such bundles include af…

2017-07-08abs ↗pdf ↗

New adaptive stepsize method for stochastic approximation converges to target point.

problem Finding optimal step sizes for stochastic approximation algorithms.
method Adaptive block-coordinate stepsizes using online estimates of second moment.
result New method converges almost surely to a small neighborhood of the target point.

ATLAS uses LLMs to adaptively trade by optimizing prompts and coordinating agents.

problem Adapting LLMs for real-time financial decision-making in noisy markets.
method ATLAS integrates structured market data, uses Adaptive-OPRO for prompt optimization, and employs multi-agent coordination.
result Adaptive-OPRO consistently outperforms fixed prompts in financial trading.

Canonical transformation plays a fundamental role in simplifying and solving classical Hamiltonian systems. We construct flexible and powerful canonical transformations as generative models using symplectic neural networks. The model transforms physical variables towards a latent representation with an independent harm…

2019-09-30abs ↗pdf ↗

CViT learns complex physical systems using vision transformer techniques.

problem Learning maps between infinite-dimensional function spaces in scientific machine learning.
method Combines vision transformer encoder, grid-based coordinate embedding, and cross-attention mechanism.
result Achieves state-of-the-art performance on multiple benchmarks, often surpassing larger models.

Coordinate descent methods usually minimize a cost function by updating a random decision variable (corresponding to one coordinate) at a time. Ideally, we would update the decision variable that yields the largest decrease in the cost function. However, finding this coordinate would require checking all of them, which…

2017-12-08abs ↗pdf ↗

CODA resolves coordination issues in offline multi-agent reinforcement learning.

problem Coordination failure in offline multi-agent reinforcement learning.
method Diffusion-based multi-agent trajectory generator for data augmentation.
result CODA resolves coordination pathologies in continuous polynomial games and complex benchmarks.

This work further develops the properties of fractional differential forms. In particular, finite dimensional subspaces of fractional form spaces are considered. An inner product, Hodge dual, and covariant derivative are defined. Coordinate transformation rules for integral order forms are also computed. Matrix order f…

2003-01-13abs ↗pdf ↗

Adaptive stochastic gradient algorithms in the Euclidean space have attracted much attention lately. Such explorations on Riemannian manifolds, on the other hand, are relatively new, limited, and challenging. This is because of the intrinsic non-linear structure of the underlying manifold and the absence of a canonical…

2019-02-04abs ↗pdf ↗

Coordinate descent methods employ random partial updates of decision variables in order to solve huge-scale convex optimization problems. In this work, we introduce new adaptive rules for the random selection of their updates. By adaptive, we mean that our selection rules are based on the dual residual or the primal-du…

2017-03-07abs ↗pdf ↗

Given a finite collection of C1C^1 vector fields on a C2C^2 manifold which span the tangent space at every point, we consider the question of when there is locally a coordinate system in which these vector fields are real analytic. We give necessary and sufficient, coordinate-free conditions for the existence of such a…

2018-08-14abs ↗pdf ↗

Bundle gerbes are a higher version of line bundles, we present nonabelian bundle gerbes as a higher version of principal bundles. Connection, curving, curvature and gauge transformations are studied both in a global coordinate independent formalism and in local coordinates. These are the gauge fields needed for the con…

2003-12-15abs ↗pdf ↗