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.

169,051 papers · 148 categories

Trend · papers per month

25.0%50.0%75.0%100.0% · Sep 199219922001200920172026
48 results for natural rounding

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 ↗

We investigate the evolution of closed strictly convex hypersurfaces in Rn+1\mathbb{R}^{n+1}, n=3, for contracting normal velocities, including powers of the mean curvature, of the norm of the second fundamental form, and of the Gauss curvature. We prove convergence to a round point for 2-pinched initial hypersurfaces. I…

2015-02-27abs ↗pdf ↗

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.

A new compression technique reduces communication costs in distributed deep learning.

problem Communication bottlenecks in distributed deep learning training.
method Natural Compression (NC) and Natural Dithering.
result Natural Compression increases communication savings by 3-4 times with negligible convergence speed impact.

Distributed algorithms for online linear regression in networked settings.

problem Online linear regression in a distributed network with various feedback types and adversary strategies.
method Simple gradient descent and averaging steps at each node, with regret bounds established.
result Regret bounds of O(T3/4){\cal O}(T^{3/4}) for unbounded decision sets and O(T){\cal O}(\sqrt{T}) for bounded decision sets.

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.

Nearly G2G_2-structures are unstable under a modified G2G_2-Laplacian co-flow.

problem Stability of nearly G2G_2-structures under geometric flows.
method Normalized modified G2G_2-Laplacian co-flow.
result Many nearly G2G_2-structures are unstable, with the standard structure on the round 7-sphere being an unstable critical point.

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.

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.

The paper develops a robust algorithm for contextual bandits with heavy-tailed rewards.

problem Contextual bandits with heavy-tailed rewards.
method Develops an algorithm based on Catoni's estimator for robust statistics, applying it to contextual bandits with general function approximation.
result Establishes regret bounds that depend on cumulative reward variance and logarithmically on the reward range and number of rounds.

A physically natural potential energy for simple closed curves in R3\bold R^3 is shown to be invariant under Möbius transformations. This leads to the rapid resolution of several open problems: round circles are precisely the absolute minima for energy; there is a minimum energy threshold below which knotting cannot oc…

1993-01-01abs ↗pdf ↗

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.

In this work we consider adversarial contextual bandits with risk constraints. At each round, nature prepares a context, a cost for each arm, and additionally a risk for each arm. The learner leverages the context to pull an arm and then receives the corresponding cost and risk associated with the pulled arm. In additi…

2016-10-17abs ↗pdf ↗

We study solutions of high codimension mean curvature flow defined for all negative times, usually referred to as ancient solutions. We show that any compact ancient solution whose second fundamental form satisfies a certain natural pinching condition must be a family of shrinking spheres. Andrews and Baker have shown …

2017-09-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.

Safe algorithm for linear bandits with safety constraints, matching previous results.

problem Designing safe bandit algorithms with linear safety constraints.
method Linear Thompson Sampling with frequentist regret analysis.
result Frequentist regret of order O(d3/2log1/2dT1/2log3/2T)\mathcal{O} (d^{3/2}\log^{1/2}d \cdot T^{1/2}\log^{3/2}T).

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.

Weyl's tube formula holds for various cross-sections under symmetry conditions.

problem Can the volume of tubes around submanifolds be calculated for non-round cross-sections?
method Investigated the volume of tubes with general cross-sections D under symmetry conditions.
result The volume of tubes around submanifolds can be calculated for general cross-sections under symmetry conditions.

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.