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

Trend · papers per month

20405979 · Jun 202619922001200920172026
48 results for fixed-length curves

The study finds solutions to a curvature minimisation problem in fixed-length curves.

problem Minimizing the LL^\infty-norm of curvature among curves of fixed length.
method Characterized solutions by a system of differential equations and classified the structure of solutions.
result Characterized solutions to the LL^\infty-norm of curvature problem.

Study curves evolving by gradient flow of elastic energy, proving existence, smoothing, and convergence.

problem Evolution of curves with fixed length and clamped boundary conditions.
method Negative L2L^2-gradient flow of elastic energy, existence, parabolic smoothing, constrained Lojasiewicz-Simon gradient inequality.
result Convergence to a critical point as time tends to infinity.

Study on dynamic curves with elastic energy and spontaneous curvature.

problem Modeling and analyzing dynamic planar curves with elastic energy.
method Gradient flow of inclination angle, nonlocal quasilinear system, local well-posedness, global existence, convergence.
result Local well-posedness, global existence, convergence of the flow for weak regularity initial data.

We show that a smooth unknotted curve in R^3 satisfies an isoperimetric inequality that bounds the area of an embedded disk spanning the curve in terms of two parameters: the length L of the curve and the thickness r (maximal radius of an embedded tubular neighborhood) of the curve. For fixed length, the expression giv…

2003-06-21abs ↗pdf ↗

Relatively extremal knots are the relative minima of the ropelength functional in C^1 topology. On the set curves of fixed length, they are the relative maxima of thickness (normal injectivity radius) functional, including the ideal knots. We prove that a C^{1,1} relatively extremal knot in R^n has thickness equal to h…

2002-04-04abs ↗pdf ↗

We study mapping class group orbits of homotopy and isotopy classes of curves with self-intersections. We exhibit the asymptotics of the number of such orbits of curves with a bounded number of self-intersections, as the complexity of the surface tends to infinity. We also consider the minimal genus of a subsurface tha…

2016-03-02abs ↗pdf ↗

In this article we study the regularity of stationary points of the knot energies EαE^α introduced by O'Hara in the range α(2,3)α\in (2,3). In a first step we prove that EαE^α is C1C^1 on the set of all regular embedded closed curves belonging to H(α+1)/2,2H^{(α+1)/2,2} and calculate its derivative. After that we use the structure…

2011-11-29abs ↗pdf ↗

Moduli spaces of hyperbolic surfaces with geodesic boundary components of fixed lengths may be endowed with a symplectic structure via the Weil-Petersson form. We show that, as the boundary lengths are sent to infinity, the Weil-Petersson form converges to a piecewise linear form first defined by Kontsevich. The proof …

2010-10-20abs ↗pdf ↗

RATQ is a new quantizer for optimizing noisy gradients in machine learning.

problem Optimizing noisy gradients in stochastic optimization.
method RATQ uses Hadamard transform and adaptive uniform quantization, and achieves near-optimal performance.
result RATQ nearly achieves information theoretic lower bounds for optimization accuracy.

Click-through rate prediction is an essential task in industrial applications, such as online advertising. Recently deep learning based models have been proposed, which follow a similar Embedding\&MLP paradigm. In these methods large scale sparse input features are first mapped into low dimensional embedding vectors, a…

2017-06-21abs ↗pdf ↗

We consider the expected value for the total curvature of a random closed polygon. Numerical experiments have suggested that as the number of edges becomes large, the difference between the expected total curvature of a random closed polygon and a random open polygon with the same number of turning angles approaches a …

2012-10-24abs ↗pdf ↗

Transformers trained with three normalization changes outperform state-of-the-art on low-resource translation tasks.

problem Improving the training of Transformers, especially on low-resource datasets.
method Three normalization changes: PreNorm, ScaleNorm, and FixNorm.
result Significant improvements in BLEU scores on low-resource translation tasks.

We study a simple model of bicycle motion: a segment of fixed length in multi-dimensional Euclidean space, moving so that the velocity of the rear end is always aligned with the segment. If the front track is prescribed, the trajectory of the rear wheel is uniquely determined via a certain first order differential equa…

2017-05-17abs ↗pdf ↗

This work lists and describes the main recent strategies for building fixed-length, dense and distributed representations for words, based on the distributional hypothesis. These representations are now commonly called word embeddings and, in addition to encoding surprisingly good syntactic and semantic information, ha…

2019-01-25abs ↗pdf ↗

Neural planners for RDDL MDPs produce deep reactive policies in an offline fashion. These scale well with large domains, but are sample inefficient and time-consuming to train from scratch for each new problem. To mitigate this, recent work has studied neural transfer learning, so that a generic planner trained on othe…

2019-02-08abs ↗pdf ↗

Physical knots and links are one-dimensional submanifolds of R^3 with fixed length and thickness. We show that isotopy classes in this category can differ from those of classical knot and link theory. In particular we exhibit a Gordian Split Link, a two component link that is split in the classical theory but cannot be…

2012-03-19abs ↗pdf ↗

Many objects in the real world are difficult to describe by a single numerical vector of a fixed length, whereas describing them by a set of vectors is more natural. Therefore, Multiple instance learning (MIL) techniques have been constantly gaining on importance throughout last years. MIL formalism represents each obj…

2016-09-23abs ↗pdf ↗

Neural machine translation is a recently proposed approach to machine translation. Unlike the traditional statistical machine translation, the neural machine translation aims at building a single neural network that can be jointly tuned to maximize the translation performance. The models proposed recently for neural ma…

2014-09-01abs ↗pdf ↗

Fixed angles of convex polygons lead to combinatorially rich polytopes.

problem Understanding the structure of convex polygons with fixed vertex angles.
method Combining combinatorial and geometric approaches, including dual polytopes and Schwarz-Christoffel maps.
result Fixed-angles polytopes are dual to cyclic polytopes under certain conditions.

Adaptive TFTs improve cryptocurrency price prediction accuracy.

problem Precise short-term price prediction in volatile cryptocurrency markets.
method Dynamic subseries lengths and pattern-based categorization.
result Significantly outperforms baseline models in prediction accuracy and profitability.

Motivated by the study of billiards in polygons, we prove fine results for the distribution of gaps of directions of saddle connections on translation surfaces. As an application we prove that for almost every holomorphic differential ωω on a Riemann surface of genus g2g \geq 2 the smallest gap between saddle connecti…

2010-12-20abs ↗pdf ↗

If (M,g)(M,g) is a compact Riemannian surface then the integrals of L2(M)L^2(M)-normalized eigenfunctions eje_j over geodesic segments of fixed length are uniformly bounded. Also, if (M,g)(M,g) has negative curvature and γ(t)γ(t) is a geodesic parameterized by arc length, the measures ej(γ(t))dte_j(γ(t))\, dt on R\R tend to zero in the …

2013-02-22abs ↗pdf ↗

SummerTime summarizes variable-length time series for machine learning applications.

problem Classical machine learning methods struggle with variable-length time series data.
method Summarizes time series into a fixed-length feature vector using Gaussian Mixture Models (GMM).
result Improves classification and regression performance in physical activity analysis.

NBF combines deep learning with classical filtering for better belief tracking.

problem Maintaining distributions over hidden states in partially observable systems.
method Trains neural networks to map beliefs to fixed-length vectors, updating them with incoming observations and dynamics.
result NBF efficiently tracks shifting, multimodal beliefs without particle impoverishment.

Word2vec (Mikolov et al., 2013) has proven to be successful in natural language processing by capturing the semantic relationships between different words. Built on top of single-word embeddings, paragraph vectors (Le and Mikolov, 2014) find fixed-length representations for pieces of text with arbitrary lengths, such a…

2017-11-10abs ↗pdf ↗

Constrained sequence codes have been widely used in modern communication and data storage systems. Sequences encoded with constrained sequence codes satisfy constraints imposed by the physical channel, hence enabling efficient and reliable transmission of coded symbols. Traditional encoding and decoding of constrained …

2018-09-06abs ↗pdf ↗

We study the use of a time series encoder to learn representations that are useful on data set types with which it has not been trained on. The encoder is formed of a convolutional neural network whose temporal output is summarized by a convolutional attention mechanism. This way, we obtain a compact, fixed-length repr…

2018-05-10abs ↗pdf ↗