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

Trend · papers per month

7152229 · May 202619922001200920172026
48 results for round half-point

Study on curve shortening flow with boundary conditions, proving convergence or contraction.

problem Analyzing curve shortening flow with free boundaries.
method Introduced a reflected chord-arc profile and obtained chord-arc estimates.
result Proved that flows either converge to a critical chord or contract to a round half-point.

The paper proves the existence and properties of geodesics on convex surfaces.

problem Existence and properties of geodesics on convex surfaces with free boundaries.
method Free boundary curve shortening flow on closed surfaces with strictly convex boundary.
result Existence of two free boundary embedded geodesics and geodesics with Morse Index 1 and 2.

Gradient descent with biased rounding errors converges faster under certain conditions.

problem Stagnation or negative impact of rounding errors in neural network training with low precision.
method Analysis of gradient descent with stochastic fixed-point rounding errors under the Polyak-Lojasiewicz inequality.
result Biased rounding errors can improve convergence rates, especially when the Polyak-Lojasiewicz inequality holds.

Contact round surgeries on (S3,ξst)(\mathbb{S}^3,ξ_{st}) help in constructing and understanding contact 3-manifolds.

problem Constructing contact 3-manifolds using Legendrian surgeries.
method Introducing contact round surgeries of indices 1 and 2, and associating them with surgery diagrams.
result Every closed connected contact 3-manifold can be obtained by a sequence of contact round surgeries on Legendrian knots in (S3,ξst)(\mathbb{S}^3,ξ_{st}).

In this article, we extend Huisken's theorem that convex surfaces flow to round points by mean curvature flow. We construct certain classes of mean convex and non-mean convex hypersurfaces that shrink to round points and use these constructions to create pathological examples of flows. We find a sequence of flows that …

2019-01-09abs ↗pdf ↗

Optimizes sample and round complexity in adaptive sampling from multiple distributions.

problem Adaptive sampling from multiple distributions with limited rounds and samples.
method Introduces OODS framework and analyzes tradeoffs between sample and round complexity.
result Achieves near-optimal sample complexity and sub-polynomial round complexity.

Consider an analytic map of a neighborhood of 0 in a vector space to a Euclidean space. Suppose that this map takes all germs of lines passing through 0 to germs of circles. Such a map is called rounding. We introduce a natural equivalence relation on roundings and prove that any rounding, whose differential at 0 has r…

2002-12-06abs ↗pdf ↗

This work investigates how multi-round reasoning improves LLM performance.

problem Improving problem-solving abilities in complex tasks with LLMs.
method Investigates approximation, learnability, and generalization properties of multi-round auto-regressive models.
result Transformers with finite context windows are universal approximators for Turing-computable functions and can approximate any Turing-computable sequence-to-sequence function through multi-round reasoning.

Gradient descent stagnates in low-precision, but unbiased rounding schemes improve convergence.

problem Stagnation of gradient descent in low-precision computation.
method Proposed unbiased stochastic rounding schemes that trade zero bias for larger probability of preserving small gradients.
result Unbiased rounding methods typically improve convergence rate of gradient descent for convex problems.

A half-geodesic is a closed geodesic realizing the distance between any pair of its points. All geodesics in a round sphere are half-geodesics. Conversely, this note establishes that Riemannian spheres with all geodesics closed and sufficiently many half-geodesics are round.

2019-04-27abs ↗pdf ↗

The study characterizes round spheres in Euclidean space based on r-mean curvature conditions.

problem Characterizing round spheres in Euclidean space under specific curvature conditions.
method Characterization based on r-mean curvature conditions.
result Characterizes round spheres in Euclidean space under suitable r-mean curvature conditions.

Contact round surgery of contact 3-manifolds is introduced in this paper. By using this method, an alternative proof of the existence of a contact structure on any closed orientable 3-manifold is given. It is also proved that any contact structure on any closed orientable 3-manifold is constructed from the standard con…

2017-03-12abs ↗pdf ↗

Study cohomology rings of 3D manifolds with round fold maps into the plane.

problem Understanding cohomology rings of 3D manifolds with round fold maps.
method Analyzing cohomology rings of 3D manifolds admitting round fold maps into the plane.
result Explicit new study showing relation between coefficient rings and topological types of round fold maps.

Research explores real algebraic realization of round fold maps of codimension -1.

problem Real algebraic realization of round fold maps of codimension -1.
method Generalizes canonical projections of unit spheres to round fold maps and discusses their real algebraic realization.
result Developed new studies in real algebraic geometry focusing on round fold maps of codimension -1.

We present the Round Handle Problem, proposed by Freedman and Krushkal. It asks whether a collection of links, which contains the Generalised Borromean Rings, are slice in a 4-manifold R constructed from adding round handles to the four ball. A negative answer would contradict the union of the surgery conjecture and th…

2017-06-29abs ↗pdf ↗

High-frequency traders can act as either small informed traders or round-trippers, affecting price discovery and liquidity.

problem Effects of high-frequency trading on price discovery and liquidity.
method Extended Kyle's model with interactions between large informed traders and high-frequency traders.
result High-frequency traders can act as Small-IT or Round-Tripper, impacting price discovery and liquidity.

One-round FL method improves robustness and reduces communication rounds.

problem Making predictions robust and reducing FL communication rounds in heterogeneous data.
method Bayesian predictive space aggregation of client posteriors in one round.
result One-round FL method outperforms other techniques on heterogeneous settings.

This paper studies a deformation retraction of Teichmüller space and its analogy with well-rounded retractions.

problem Understanding the well-rounded deformation retraction of Teichmüller space.
method Examining the mapping class group-equivariant deformation retraction of Teichmüller space onto a CW complex and comparing it to well-rounded retractions of other spaces.
result The well-rounded deformation retraction of Teichmüller space is analogous to well-rounded retractions of other spaces.

We consider the problem of learning a general graph G=(V,E)G=(V,E) using edge-detecting queries, where the number of vertices V=n|V|=n is given to the learner. The information theoretic lower bound gives mlognm\log n for the number of queries, where m=Em=|E| is the number of edges. In case the number of edges mm is also given t…

2018-03-28abs ↗pdf ↗

Proposes rounding method for precise treatment effect estimation under budget constraints.

problem Resource-constrained experimental design for precise treatment effect estimation.
method Dependent randomized rounding procedure to convert assignment probabilities into binary treatment decisions.
result Improved estimator precision through variance reduction and efficient inference.

In this paper, we construct round fold maps or stable fold maps with concentric singular value sets introduced by the author on smooth bundles over spheres or bundles over more general manifolds. The class of round fold maps includes special generic maps on spheres and such maps have been constructed on smooth bundles …

2013-05-08abs ↗pdf ↗

CRA improves UL-based CO solvers by dynamically smoothing and enforcing discreteness.

problem Local optima and artificial rounding issues in UL-based CO solvers.
method Continuous Relaxation Annealing (CRA) strategy that dynamically shifts from continuous to discrete solutions.
result Significantly enhances UL-based CO solver performance and eliminates artificial rounding.

A new algorithm reduces communication rounds for distributed convex optimization.

problem Efficiently solving convex optimization problems in distributed systems.
method Proposes a stochastic Newton algorithm for homogeneous distributed stochastic convex optimization.
result Reduces the number and frequency of communication rounds compared to existing methods.

Authors construct hypertori with constant negative mean curvature in a sphere.

problem Constructing constant mean curvature hypertori in a sphere.
method Constructing two different constant mean curvature (2n1)(2n-1)-dimensional hypertori in a 2n2n-dimensional sphere.
result Two different constant mean curvature (2n1)(2n-1)-dimensional hypertori with negative mean curvature in a 2n2n-dimensional sphere.

We introduce cosymplectic circles and cosymplectic spheres, which are the analogues in the cosymplectic setting of contact circles and contact spheres. We provide a complete classification of compact 3-manifolds that admit a cosymplectic circle. The properties of tautness and roundness for a cosymplectic pp-sphere are…

2014-06-09abs ↗pdf ↗

In low dimensions, minimizers for the second conformal eigenvalue do not exist near the round sphere.

problem Nonexistence of minimizers for the second conformal eigenvalue near the round sphere in low dimensions.
method Analysis of conformal classes and renormalized volume in dimensions 3 to 10.
result Existence of minimizers is proven not to hold for metrics sufficiently close to the round metric on the sphere in dimensions 3 to 10.

SAFLe solves federated learning's trade-off between non-linearity and scalability.

problem Federated Learning's high communication overhead and performance collapse on non-IID data.
method SAFLe introduces a structured head of bucketed features and sparse, grouped embeddings, mathematically equivalent to a high-dimensional linear regression.
result SAFLe achieves a new state-of-the-art in analytic FL, outperforming linear AFL and multi-round DeepAFL.

We compute the spectral action of SU(2)/ΓSU(2)/Γ with the trivial spin structure and the round metric and find it in each case to be equal to 1Γ(Λ3f^(2)(0)1/4Λf^(0))+O(Λ)\frac{1}{|Γ|} (Λ^3 \hat{f}^{(2)}(0) - 1/4Λ\hat{f}(0))+ O(Λ^{-\infty}). We do this by explicitly computing the spectrum of the Dirac operator for SU(2)/ΓSU(2)/Γ equipped with the trivial …

2010-10-09abs ↗pdf ↗