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

159318476635 · Jun 202019922001200920172026
48 results for linear orders

Minimal surfaces in third-order ODEs identified for linear second-order ODEs.

problem Characterizing minimal surfaces in third-order ODEs.
method Analyzing submanifolds of third-order ODEs as Riemannian manifolds.
result Linear second-order ODEs with y=±y+β(x)y''=\pm y+β(x) are the only minimal surfaces and totally geodesic.

Differentiable relaxation for inferring partial orders from noisy linear data.

problem Inference of partial orders from linear data with noisy observations.
method Introducing a differentiable relaxation to model noisy linear extensions, replacing discontinuous precedence and feasibility with smooth surrogates.
result Smooth posterior that preserves partial-order semantics, supports gradient-based inference, and converges to hard likelihood.

Two algorithms solve nonconvex minimax problems with linear constraints, achieving complexity guarantees.

problem Nonconvex minimax problems with coupled linear constraints.
method Zeroth-order primal-dual alternating projected gradient (ZO-PDAPG) and zeroth-order regularized momentum primal-dual projected gradient (ZO-RMPDPG) algorithms.
result Iteration complexity guarantees for solving nonconvex-(strongly) concave minimax problems with coupled linear constraints.

Clarifies method of phase synchronization for decoupling linear differential equations.

problem Velocity-dependent transformations in linear second-order differential equations.
method Linear transformation of coordinates and velocities.
result Velocity-dependent transformations do not preserve second-order character and define their own system.

First-order method solves stochastic bilevel optimization with linear constraints.

problem Stochastic bilevel optimization with linear constraints and noise.
method Developed a novel framework using gradient-based techniques and smoothed penalty functions.
result Achieved finite-time convergence guarantees for (δ,ε)(δ, ε)-Goldstein stationary points.

If a knot has the Alexander polynomial not equal to 1, then it is linear nn-colorable. By means of such a coloring, such a knot is given an upper bound for the minimal quandle order, i.e., the minimal order of a quandle with which the knot is quandle colorable. For twist knots, we study the minimal quandle orders in d…

2011-10-18abs ↗pdf ↗

Improved regret bounds for adversarial linear contextual bandits.

problem Adversarial linear contextual bandits with changing loss functions.
method Truncated continuous exponential weights algorithm over the probability simplex, analyzing with linear bandit setting without contexts.
result Second-order bound of ildeO(KdVT) ilde O(K\sqrt{d V_T}) and first-order bound of ildeO(KdLT) ilde O(K\sqrt{d L_T^*}).

Proposes efficient sampling methods for solving linear inverse problems.

problem Solving linear inverse problems with computational efficiency and accuracy.
method Higher-order Langevin diffusion with pre-conditioning and annealing.
result Provable sampling from posterior distributions with accelerated convergence.

Study solves inverse problems for equations with fractional nonlinearities.

problem Solving inverse problems for semilinear elliptic equations with fractional power nonlinearities.
method Higher order linearization method adapted for fractional order.
result Results of previous studies remain valid for general power nonlinearities.

Transformers can approximate Newton's method for logistic regression.

problem Implementing higher order optimization methods in Transformers.
method Linear attention Transformers with ReLU layers approximating second order optimization algorithms.
result Transformers can implement a single step of Newton's iteration for matrix inversion.

New method reduces ensemble size for linear bandits, achieving near optimal regret.

problem Achieving near optimal regret in linear bandits with limited ensemble size.
method Ensemble sampling with a size of order dlogTd \log T for a dd-dimensional stochastic linear bandit.
result Regret is at most (dlogT)5/2T(d \log T)^{5/2} \sqrt{T}, improving over linear scaling with TT.

Motivated by well known results in low-dimensional topology, we introduce and study a topology on the set CO(G) of all left-invariant circular orders on a fixed countable and discrete group G. CO(G) contains as a closed subspace LO(G), the space of all left-invariant linear orders of G, as first topologized by Sikora. …

2015-08-11abs ↗pdf ↗

This paper is centred on solving differential equations by symmetry groups for first order ODEs and is in response to Starrett (2007). It also explores the possibility of averting the assumptions by Olver (2000) that, in practice finding the solutions of the linearized symmetry condition is usually a much more difficul…

2013-01-28abs ↗pdf ↗

Paper proposes a new method to identify causal graphs with latent variables using higher-order cumulants.

problem Estimating causal directed acyclic graphs with latent confounders.
method Uses higher-order cumulants to identify causal structures among observed and latent variables.
result Validates the proposed algorithm through simulations and real-world data.

Unified approach to discrete and smooth isoperimetric inequalities of arbitrary order.

problem Finding higher order isoperimetric inequalities for both discrete and smooth curves.
method Unified approach via Fourier analysis of linear operators.
result Unified upper and lower bounds for isoperimetric deficit in smooth curves.

Paper analyzes LSA algorithm bias and error bounds with RR extrapolation.

problem Analyzing bias and high-order error bounds of LSA with Markovian noise.
method Polyak-Ruppert averaging, linearization, Richardson-Romberg extrapolation.
result RR extrapolation effectively cancels the leading bias term.

The reduction theorems for general linear and classical connections are generalized for operators with values in higher order gauge-natural bundles. We prove that natural operators depending on the s1s_1-jets of classical connections, on the s2s_2-jets of general linear connections and on the rr-jets of tensor fields …

2004-05-26abs ↗pdf ↗

Equivalence of second order differential operators in vector bundles studied.

problem Equivalence problem for second order linear differential operators in vector bundles.
method Description of rational invariants of symbols, finding connections associated with differential operators.
result Solving problems of local and global equivalency of differential operators.

We present an extension of the Kolmogorov-Smirnov (KS) two-sample test, which can be more sensitive to differences in the tails. Our test statistic is an integral probability metric (IPM) defined over a higher-order total variation ball, recovering the original KS test as its simplest case. We give an exact representer…

2019-03-24abs ↗pdf ↗

Paper establishes sufficient condition for comparing linear combinations of infinite-mean risks.

problem Comparing linear combinations of infinite-mean risks under stochastic dominance.
method Introduced a new class of distributions and used majorization order to compare weights.
result Linear combinations of random variables are stochastically larger when their weight vectors are smaller in majorization order.

Following the programme set out in Part I of this work, we develop a conceptual higher order differential calculus. The '' local linear algebra '' defined in Part I is generalized by '' higher order local linear algebra ''. The underlying combinatorial object of such higher algebra is the natural n-dimensional hyper-cu…

2015-10-12abs ↗pdf ↗

RFMs transition from linear to nonlinear under specific input-label correlation.

problem Understanding the transition from linear to nonlinear behavior in RFMs.
method Analyzing RFMs under spiked covariance designs, characterizing the interaction between anisotropy and input-label correlation.
result The RFM generalization error is governed by the strength of input-label correlation, leading to a clear nonlinear advantage above a specific boundary.

New algorithm trains neural networks in near-linear time, overcoming slow convergence issues.

problem Slow convergence and computational overhead in training deep neural networks.
method Reformulates Gauss-Newton iteration as an ℓ2-regression problem and uses Fast-JL dimension reduction.
result Achieves an O(mn)-time algorithm for training ReLU networks, near-linear in dimension.

A new probabilistic BTD method for tensor data.

problem Modeling higher-order tensors with robust inference.
method Probabilistic Block-Term Decomposition using variational Bayesian inference and von-Mises Fisher distribution.
result The proposed pBTD can quantify multi-linear structures robustly.

We study the price impact of order book events - limit orders, market orders and cancelations - using the NYSE TAQ data for 50 U.S. stocks. We show that, over short time intervals, price changes are mainly driven by the order flow imbalance, defined as the imbalance between supply and demand at the best bid and ask pri…

2010-11-29abs ↗pdf ↗

This paper improves online learning algorithms for LP problems, achieving better regret bounds.

problem Achieving optimal regret bounds in online linear programming.
method Develops a new framework for first-order online learning algorithms under certain error bound conditions.
result First-order learning algorithms achieve o(T)o(\sqrt{T}) regret in continuous support and O(logT)\mathcal{O}(\log T) regret in finite support, improving over O(T)\mathcal{O}(\sqrt{T}).

Gronwall conjecture states that a planar 3-web which admits more than one distinct linearization is locally equivalent to an algebraic web. We give a partial answer to the conjecture in the affirmative for the class of planar 3-webs with the web curvature that vanishes to order three at a point. The differential relati…

2011-02-01abs ↗pdf ↗