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

Trend · papers per month

1.0%2.0%3.0%4.1% · Aug 202019922001200920172026
48 results for speed bumps

Speed bumps reduce but do not fully eliminate investment in fast trading technology.

problem Limiting low-latency trading to curb investment in fast trading technology.
method Built an experimental trading platform to test the effects of speed bumps on investment in fast trading technology.
result Asymmetric speed bumps reduce investment in speed by only 20%, and increasing the magnitude further reduces investment by 8.33%. Symmetric speed bumps have no effect on investment levels.

We consider the multi-bump solutions of the following fractional Nirenberg problem \begin{equation}\label{01} (-Δ)^s u=K(x)u^{\frac{n+2s}{n-2s}}, \;\;\;\;u>0\;\;\text{ in }\mathbb{R}^n, \end{equation} where s(0,1)s\in (0,1) and n>2+2sn>2+2s. If KK is a periodic function in some kk variables with 1k<n2s21\leq k<\frac{n-2s}2, we pr…

2016-12-13abs ↗pdf ↗

The paper introduces a new method to find meaningful data subsets in multivariate probability density functions.

problem Finding meaningful data subsets in multivariate probability density functions.
method The paper defines an abstract bump construct based on curvature functionals of the probability density and proposes a multivariate implementation of Good and Gaskins' original concave bumps.
result The method provides theoretical results for asymptotic consistency of bump boundaries and confidence regions.

We show here that the Nielsen core of the bumping set of the domain of discontinuity of a Kleinian group ΓΓ is the boundary of the characteristic submanifold of the associated 3-manifold with boundary. Some examples of interesting characteristic submanifolds are given. We also give a construction of the characteristic…

2012-08-08abs ↗pdf ↗

The level curves of an analytic function germ almost always have bumps at unexpected points near the singularity. This profound discovery of N. A'Campo is fully explored in this paper for $f(z,w)\in \C\{z,w\}$, using the Newton-Puiseux infinitesimals and the notion of gradient canyon. Equally unexpected is the Dirac ph…

2012-06-04abs ↗pdf ↗

Finite-precision learning of anh anh networks is limited by the Monte Carlo rate.

problem Learning anh anh neural networks under finite precision
method Using iterated anh anh activations to construct localized bump functions
result No adaptive randomized algorithm can achieve higher convergence rate than Monte Carlo rate in finite precision

New supervised and unsupervised NFLTs for elliptical distributions.

problem Understanding unsupervised No Free Lunch Theorems for elliptical distributions.
method Proved two equally optimal strategies for elliptical distributions, inspired PRIM-based bump-hunting algorithms.
result Optimal strategies for selecting principal components based on variance or volume.

Splat Regression Models use mixtures of bump functions to approximate complex data.

problem Approximating complex data with high interpretability and accuracy.
method Model outputs are mixtures of heterogeneous and anisotropic bump functions (splats) weighted by output vectors. Fitting splat models reduces to optimization over mixing measures using Wasserstein-Fisher-Rao gradient flows.
result Unified theoretical framework for Gaussian Splatting and flexible approach for diverse problems.

The study classifies geometrically finite polynomials on the boundary of Blaschke products.

problem Understanding the boundaries of hyperbolic components of Blaschke products.
method Combinatorial classification and construction of self-bumps.
result The closure of the main hyperbolic component is not a topological manifold with boundary for d4d\geq 4.

Bayesian predictive inference analyzes a dataset to make predictions about new observations. When a model does not match the data, predictive accuracy suffers. We develop population empirical Bayes (POP-EB), a hierarchical framework that explicitly models the empirical population distribution as part of Bayesian analys…

2014-11-02abs ↗pdf ↗

The concept of subdifferentiability is studied in the context of C1C^1 Finsler manifolds (modeled on a Banach space with a Lipschitz C1C^1 bump function). A class of Hamilton-Jacobi equations defined on C1C^1 Finsler manifolds is studied and several results related to the existence and uniqueness of viscosity solutions…

2014-07-10abs ↗pdf ↗

Let NN be a hyperbolic 3-manifold and BB a component of the interior of AH(π1(N))AH(π_1(N)), the space of marked hyperbolic 3-manifolds homotopy equivalent to NN. We will give topological conditions on NN sufficient to give ρBˉρ\in \bar{B} such that for every small neighborhood VV of ρρ, VBV \cap B is disconnected. This …

2000-09-15abs ↗pdf ↗

In this paper we give a necessary and sufficient condition in which a sequence of Kleinian punctured torus groups converges. This result tells us that every exotically convergent sequence of Kleinian punctured torus groups is obtained by the method due to Anderson and Canary. Thus we obtain a complete description of th…

2007-01-12abs ↗pdf ↗

New study shows acceleration in hyperbolic spaces is impossible for strongly geodesically convex functions.

problem Acceleration in hyperbolic spaces for strongly geodesically convex functions is impossible.
method Perturbing hard functions with sums of bump functions chosen by a resisting oracle.
result Acceleration is unachievable for any deterministic algorithm in hyperbolic spaces for strongly geodesically convex functions.

Principal Components Analysis is a widely used technique for dimension reduction and characterization of variability in multivariate populations. Our interest lies in studying when and why the rotation to principal components can be used effectively within a response-predictor set relationship in the context of mode hu…

2014-09-30abs ↗pdf ↗

This is supplementary material for the main Geodesics article by the authors. In Appendix A, we present some general results on the construction of Gaussian random fields. In Appendix B, we restate our Shape Theorem, specialized to the setting of this article. In Appendix C, we state some straightforward consequences o…

2012-06-21abs ↗pdf ↗

Study on optimal ReLU networks with weight decay for interpolation.

problem Interpolating data with radially symmetric distributions using shallow ReLU networks.
method Weight decay regularization in infinite neuron, infinite data limit; analysis of growth rates.
result Existence and growth rates of unique radially symmetric minimizers with weight decay.

We analyze the disordered Riemannian geometry resulting from random perturbations of the Euclidean metric. We focus on geodesics, the paths traced out by a particle traveling in this quenched random environment. By taking the point of the view of the particle, we show that the law of its observed environment is absolut…

2012-06-21abs ↗pdf ↗

Bayesian nonparametric LABS model adapts to function smoothness in Besov spaces.

problem Estimating functions with unknown smoothness in Besov spaces.
method Lévy Adaptive B-spline (LABS) regression model with automatic smoothness adaptation.
result LABS posterior contracts around true function in Besov classes at nearly minimax-optimal rates.

Exchanges acquire excess processing capacity to accommodate trading activity surges associated with zero-sum high-frequency trader (HFT) "duels." The idle capacity's opportunity cost is an externality of low-latency trading. We build a model of decentralized exchanges (DEX) with flexible capacity. On DEX, HFTs acquire …

2019-07-24abs ↗pdf ↗

ANODE uses neural density estimation for anomaly detection in physics.

problem Detecting localized anomalies in signal regions with limited background information.
method Estimate data and background densities, construct likelihood ratio, and enhance significance.
result ANODE enhances dijet bump hunt significance by up to 7x with 10% background accuracy.

This paper establishes for the first time the predictive performance of speed priors and their computational complexity. A speed prior is essentially a probability distribution that puts low probability on strings that are not efficiently computable. We propose a variant to the original speed prior (Schmidhuber, 2002),…

2016-04-12abs ↗pdf ↗

Model predicts traffic speed using urban incidents.

problem Accurately predicting traffic speed in urban areas.
method Deep Incident-Aware Graph Convolutional Network (DIGC-Net).
result Model outperforms competing benchmarks in traffic speed prediction.

Study shows convergence speed for Fekete points on specific sets.

problem Understanding convergence speed for Fekete points on certain sets.
method Demonstrates (Cα,Cα)(\mathscr{C}^α, \mathscr{C}^{α'})-regularity for uniformly polynomially cuspidal sets.
result Established convergence speed for Fekete points on these sets.