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

Trend · papers per month

216431647862 · Jun 202019922001200920172026
48 results for weighted length functional

We propose a new approach to the problem of neural network expressivity, which seeks to characterize how structural properties of a neural network family affect the functions it is able to compute. Our approach is based on an interrelated set of measures of expressivity, unified by the novel notion of trajectory length…

2016-06-16abs ↗pdf ↗

Quasimodular forms were first studied in the context of counting torus coverings. Here we show that a weighted version of these coverings with Siegel-Veech weights also provides quasimodular forms. We apply this to prove conjectures of Eskin and Zorich on the large genus limits of Masur-Veech volumes and of Siegel-Veec…

2016-06-13abs ↗pdf ↗

In a family of compact, canonically polarized, complex manifolds equipped with Kähler-Einstein metrics the first variation of the lengths of closed geodesics was previously shown in by the authors in [arXiv:0808.3741v2] to be the geodesic integral of the harmonic Kodaira-Spencer form. We compute the second variation. F…

2010-06-15abs ↗pdf ↗

Previous literature on unsupervised learning focused on designing structural priors with the aim of learning meaningful features. However, this was done without considering the description length of the learned representations which is a direct and unbiased measure of the model complexity. In this paper, first we intro…

2019-07-12abs ↗pdf ↗

As in a symmetric space of noncompact type, one can associate to an oriented geodesic segment in a Euclidean building a vector valued length in the Euclidean Weyl chamber; in addition to the metric length it contains information on the direction of the segment. We study in this paper restrictions on the vector valued s…

2004-06-15abs ↗pdf ↗

Paper studies weighted Fermat-Frechet problem for simplex edge lengths.

problem Finding optimal edge lengths for simplex deformations.
method Isometric embedding techniques for KK-Space.
result New variational method to solve weighted Fermat-Frechet problem.

Thurston introduced shear deformations (cataclysms) on geodesic laminations - deformations including left and right displacements along geodesics. For hyperbolic surfaces with cusps, we consider shear deformations on disjoint unions of ideal geodesics. The length of a balanced weighted sum of ideal geodesics is defined…

2013-03-01abs ↗pdf ↗

The study examines correlations of logarithms of integers at different scalings.

problem Analyzing pair correlations of logarithms of integers at various scalings.
method Examined correlations of logarithms of positive integers at different scalings, proving the existence of pair correlation functions.
result Level repulsion at linear scaling, total loss of mass at superlinear scalings, and Poissonian behavior at sublinear scalings.

Optimizes treatment duration to maximize quality-adjusted lifetime.

problem Balancing risks and benefits in clinical decision making.
method Proposes a weighted estimating equation to adjust for confounding and informative censoring, and a nonparametric estimator for mean counterfactual quality-adjusted lifetime.
result Shows the optimal time for percutaneous endoscopic gastrostomy insertion in ALS patients.

Given a length nn sample from Rd\mathbb{R}^d and a neural network with a fixed architecture with WW weights, kk neurons, linear threshold activation functions, and binary outputs on each neuron, we study the problem of uniformly sampling from all possible labelings on the sample corresponding to different choices of…

2019-12-10abs ↗pdf ↗

Filling length measures the length of the contracting closed loops in a null-homotopy. The filling length function of Gromov for a finitely presented group measures the filling length as a function of length of edge-loops in the Cayley 2-complex. We give a bound on the filling length function in terms of the log of an …

2000-08-03abs ↗pdf ↗

The paper improves model-based reinforcement learning by using multi-timestep objectives.

problem Compounding errors in one-step dynamics models as trajectory length increases.
method Developed a multi-timestep objective as a weighted sum of losses at various future horizons.
result Exponentially decaying weights significantly improve long-horizon performance.

Smoothly conjugate Anosov flows on 3D manifolds are actually smoothly conjugate.

problem Smoothly conjugate 3D Anosov flows are not always smoothly conjugate.
method Proved smooth rigidity for volume preserving Anosov flows on 3-manifolds.
result Smooth conjugacy implies smooth conjugacy for volume preserving Anosov flows.

Algorithm minimizes regret and converges to equilibria in Markov games.

problem Regret minimization and convergence to equilibria in general-sum Markov games under adversarial opponents.
method Decentralized algorithm that uses policy optimization and controls path length to achieve sublinear regret.
result Sublinear regret guarantees for convergence to correlated equilibrium in Markov games.

New results on the convexity of geodesic-length functions on Teichmüller space are presented. A formula for the Hessian of geodesic-length is presented. New bounds for the gradient and Hessian of geodesic-length are described. A relationship of geodesic-length functions to Weil-Petersson distance is described. Applicat…

2005-02-24abs ↗pdf ↗

Extremal length is an important conformal invariant on Riemann surface. It is closely related to the geometry of Teichmuller metric on Teichmuller space. By identifying extremal length functions with energy of harmonic maps from Riemann surfaces to R\mathbb{R}-trees, we study the second variation of extremal length fu…

2012-10-02abs ↗pdf ↗

Fix a smooth closed manifold MM. Let RMR_M denote the space of all pairs (g,L)(g,L) such that gg is a C3C^3 Riemannian metric on MM and the real number LL is not the length of any closed gg-geodesics. A locally constant geodesic count function πM:RMZπ_M:R_M\rightarrow Z is constructed. For this purpose, the weight of com…

2019-12-23abs ↗pdf ↗

Symmetric TSP is structurally equivalent to a constrained Group Steiner Tree Problem.

problem Finding the shortest tour in a symmetric TSP.
method Structural equivalence between symmetric TSP and constrained Group Steiner Tree Problem.
result Maximizing net weight in the cGSTP is equivalent to minimizing the TSP tour length.

Study tackles non-stationary bandit convex optimization with new algorithms.

problem Minimizing regret in non-stationary environments with various measures of non-stationarity.
method Proposed Tilted Exponentially Weighted Average with Sleeping Experts (TEWA-SE) for strongly convex losses and clipped Exploration by Optimization (cExO) for general convex losses.
result Proved minimax-optimality of TEWA-SE for strongly convex losses and introduced cExO for general convex losses.

Link between Teichmüller and anti de Sitter geometry via length functions.

problem Understanding the geometry of Teichmüller space and anti de Sitter manifolds.
method Establishing a connection between Teichmüller space and anti de Sitter geometry through length functions.
result New purely anti de Sitter proofs of Teichmüller theory results.

The flat trace of geodesic Koopman operators varies with negatively curved surfaces.

problem Understanding how the flat trace of geodesic Koopman operators changes with variations of negatively curved surfaces.
method Computing the first variation of the flat trace as a distribution and analyzing its leading singularity.
result The leading singularity coefficient is a linear functional of length variations, forcing marked lengths to be locally constant.

Paper approximates BV functions using neural networks with ReLU activation.

problem Approximating BV functions with neural networks.
method Studied convergence of stochastic gradient flow and proved Poincaré inequality for penalized cost function.
result Localization theorem: Error of constrained problem is of order R1/9R^{-1/9} with respect to unconstrained problem.

Transformer learns context and regularization for ICL in inverse problems.

problem Learning context and effective regularization for transformer-based in-context learning (ICL) in inverse problems.
method Introduced a linear transformer to learn inverse mapping from contextual examples to weight vectors, addressing rank-deficient problems.
result Transformer implicitly learns a prior distribution and effective regularization strategy, outperforming traditional methods.

The aim of this (mostly expository) article is twofold. We first explore a variety of length functions on the space of currents, and we survey recent work regarding applications of length functions to counting problems. Secondly, we use length functions to provide a proof of a folklore theorem which states that pseudo-…

2018-03-28abs ↗pdf ↗

The paper aims at proving global height estimates for Killing graphs defined over a complete manifold with nonempty boundary. To this end, we first point out how the geometric analysis on a Killing graph is naturally related to a weighted manifold structure, where the weight is defined in terms of the length of the Kil…

2016-12-05abs ↗pdf ↗

A new method avoids overfitting in network reconstruction by using the minimum description length principle.

problem Determining the optimal model complexity in network reconstruction to prevent overfitting.
method Hierarchical Bayesian inference and weight quantization based on the minimum description length principle.
result The method yields increased accuracy in reconstructing both artificial and empirical networks.

In this paper, we show that the extremal length functions on Teichmüller space are log-plurisubharmonic. As a corollary, we obtain an alternative proof of L.Liu and W.Su's results on the plurisubharmonicity of extremal length functions. We also obtain alternative proofs of S.Krushkal's results that a function defined b…

2015-05-26abs ↗pdf ↗

SURF steers scalarization weights to uniformly traverse the Pareto front.

problem Non-uniform coverage of the Pareto front when using scalarization weights.
method Geometric analysis and CDF mapping to select weights for uniform coverage.
result SURF converges to uniform Pareto front coverage under provable conditions.

We introduce a new series RkR_k, k=2,3,4,k=2,3,4,\dots, of integer valued weight systems. The value of the weight system RkR_k on a chord diagram is a signed number of cycles of even length 2k2k in the intersection graph of the diagram. We show that this value depends on the intersection graph only. We check that for small o…

2013-07-18abs ↗pdf ↗

Distributed statistical learning problems arise commonly when dealing with large datasets. In this setup, datasets are partitioned over machines, which compute locally, and communicate short messages. Communication is often the bottleneck. In this paper, we study one-step and iterative weighted parameter averaging in s…

2018-09-30abs ↗pdf ↗

We study metric and analytic properties of generalized lemniscates E_t(f)={z:ln|f(z)|=t}, where f is an analytic function. Our main result states that the length function |E_t(f)| is a bilateral Laplace transform of a certain positive measure. In particular, the function ln|E_t(f)| is convex on any interval free of cri…

2003-06-23abs ↗pdf ↗