Round handles are affiliated with smooth 4-manifolds in two major ways: 5-dimensional round handles appear extensively as the building blocks in cobordisms between 4-manifolds, whereas 4-dimensional round handles are the building blocks of broken Lefschetz fibrations on them. The purpose of this article is to shed more…
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
48 results for “rounding of logarithmic spaces”
We study the decades-old problem of online portfolio management and propose the first algorithm with logarithmic regret that is not based on Cover's Universal Portfolio algorithm and admits much faster implementation. Specifically Universal Portfolio enjoys optimal regret for financial instrum…
Logarithmic regret strategies for safe multi-armed bandits with safety risk constraints.
problem Maximizing reward while avoiding unsafe arms under safety risk constraints.
method Doubly optimistic strategies with pseudo-regret formulation.
result Logarithmic regret bounds for safe multi-armed bandits.
New algorithm for online portfolio selection with reduced runtime.
problem Maximizing total return in online portfolio selection.
method Minimizes current logarithmic loss regularized by log-determinant of Hessian.
result Achieves regret guarantee similar to Universal Portfolios with reduced runtime.
Sharp upper diameter limit found for Ricci solitons.
problem Bounding the diameter of compact shrinking Ricci solitons.
method Used a sharp logarithmic Sobolev inequality and Vitali-type covering argument.
result Sharp upper diameter bound established in terms of scalar curvature and entropy.
The Milnor fiber conjecture is proven for splice type singularities.
problem Proving the Milnor fiber conjecture for a specific class of singularities.
method Combining techniques from tropical geometry, log geometry, and rounding of logarithmic spaces.
result The Milnor fiber conjecture is proven for splice type singularities.
New insights into multi-armed bandits with budget constraints.
problem Multi-armed bandits with supply/budget constraints.
method Characterization of logarithmic regret rates, simple regret, and reduction to other bandit problems.
result Full characterization of logarithmic, instance-dependent regret rates for BwK.
We propose a novel, efficient approach for distributed sparse learning in high-dimensions, where observations are randomly partitioned across machines. Computationally, at each round our method only requires the master machine to solve a shifted ell_1 regularized M-estimation problem, and other workers to compute the g…
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.
Decentralized learning for matching markets with time-varying preferences.
problem Matching between competing agents and supply arms with time-varying preferences.
method Linear contextual bandit framework, learning algorithms to identify latent environment and stable matchings.
result Achieve instance-dependent logarithmic regret, applicable for large markets.
Two new algorithms optimize decentralized convex optimization with reduced communication rounds.
problem Decentralized minimization of smooth strongly convex functions in a network.
method Proposes two new algorithms based on accelerated Forward Backward methods.
result First algorithm is optimal in terms of communication rounds and gradient computations.
The Logarithmic Singularities of the Green Functions of the Conformal Powers of the Laplacianmath.DG
Green functions play an important role in conformal geometry. In this paper, we explain how to compute explicitly the logarithmic singularities of the Green functions of the conformal powers of the Laplacian. These operators include the Yamabe and Paneitz operators, as well as the conformal fractional powers of the Lap…
Oracle-efficient algorithms reduce combinatorial semi-bandit regret to logarithmic time.
problem Scalability issue in combinatorial semi-bandit problems due to high combinatorial optimization costs.
method Oracle-efficient frameworks that minimize oracle queries while maintaining tight regret guarantees.
result Achieved regret with oracle queries for worst-case linear rewards.
We study the question of whether parallelization in the exploration of the feasible set can be used to speed up convex optimization, in the local oracle model of computation. We show that the answer is negative for both deterministic and randomized algorithms applied to essentially any of the interesting geometries and…
Study on individual regret in cooperative MAB with agents communicating over a graph.
problem Individual regret in cooperative stochastic multi-armed bandits with communication constraints.
method Analyzed COOP-SE algorithm, derived individual regret bounds under various communication constraints.
result First to show an individual regret bound in cooperative stochastic MAB independent of graph diameter.
We introduce the community exploration problem that has many real-world applications such as online advertising. In the problem, an explorer allocates limited budget to explore communities so as to maximize the number of members he could meet. We provide a systematic study of the community exploration problem, from off…
Paper analyzes and improves KL-regularized RL for LLMs with logarithmic regret.
problem Improving efficiency of RL fine-tuning for large language models.
method Optimism-based KL-regularized online contextual bandit algorithm with novel regret analysis.
result Achieves an logarithmic regret bound.
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.
We consider the stochastic multi-armed bandit (MAB) problem in a setting where a player can pay to pre-observe arm rewards before playing an arm in each round. Apart from the usual trade-off between exploring new arms to find the best one and exploiting the arm believed to offer the highest reward, we encounter an addi…
We study a basic private estimation problem: each of users draws a single i.i.d. sample from an unknown Gaussian distribution, and the goal is to estimate the mean of this Gaussian distribution while satisfying local differential privacy for each user. Informally, local differential privacy requires that each data …
We introduce a new model of stochastic bandits with adversarial corruptions which aims to capture settings where most of the input follows a stochastic pattern but some fraction of it can be adversarially changed to trick the algorithm, e.g., click fraud, fake reviews and email spam. The goal of this model is to encour…
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…
Paper generalizes VB-FTRL for online learning of quantum states with logarithmic loss.
problem Online learning of quantum states with logarithmic loss.
method Generalizes VB-FTRL algorithm for LL-OLQS with polynomial-time implementation.
result Achieves a regret rate of for LL-OLQS.
For a closed surface M with metric g, the Robin mass m(p) at the point p is the value of the Green function G(p,q) at p=q after the logarithmic singularity has been removed. The Laplacian-mass is the average value of the Robin mass, minus the value of the Robin mass for the round sphere of the same area. The Laplacian-…
New algorithm reduces online logistic regression regret without exponential constant.
problem Improper learning in online logistic regression with logarithmic regret.
method Regularized empirical risk minimization with surrogate losses.
result Regret scaling as O(B log(Bn)) with low computational complexity.
Outer space and Teichmüller space fail well-rounded retract analogy.
problem Failure of well-rounded retract in Outer space and Teichmüller space.
method Analysed flat tori and metric graphs to show failure.
result Analogue of well-rounded retract does not contain equivariant spine.
Improved cumulative regret for sequence prediction with limited expert advice.
problem Minimizing cumulative regret in sequence prediction with limited information.
method Convex combination of experts with limited observation, achieving constant regret.
result Strategies achieve constant regret independent of the horizon T, improving over standard bounds.
Study of conformal logarithmic Laplacian on sphere, connecting Yamabe problems and Sobolev spaces.
problem Yamabe-type problems and Sobolev spaces on the sphere.
method Detailed spectral analysis, conformal invariance, and Hilbert space introduction.
result Established precise connection between sphere and \(\mathbb{R}^N\) logarithmic Laplacian.
Study optimal adaptive allocation for multi-armed bandits with Markovian rewards.
problem Optimal adaptive allocation for multi-armed bandits with Markovian rewards.
method Round-robin Kullback-Leibler upper confidence bounds for optimal adaptive allocation.
result Logarithmic dependence of regret on time horizon, asymptotically optimal.
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.
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 distributed bootstrap method for high-dimensional data reduces communication rounds efficiently.
problem Simultaneous inference on massive, high-dimensional data stored across many machines.
method Distributed bootstrap based on de-biased lasso with efficient cross-validation tuning.
result Theoretical lower bound on communication rounds for statistical accuracy and efficiency.
We define the "sum of squares of the wavelengths" of a Riemannian surface (M,g) to be the regularized trace of the inverse of the Laplacian. We normalize by scaling and adding a constant, to obtain a "mass", which is scale invariant and vanishes at the round sphere. This is an anlaog for closed surfaces of the ADM mass…
Study online learning with delays and capacity constraints, achieving optimal regret bounds.
problem Online learning with delays and capacity constraints.
method Novel scheduling and preemptive techniques, matching upper and lower bounds.
result Achieves optimal regret bounds across all capacity levels.
Round cylinders are rigid in Ricci shrinkers close to the standard product.
problem Proving rigidity of round cylinders in Ricci shrinkers.
method Proving isometry using pointed-Gromov-Hausdorff topology.
result Ricci shrinkers close to are isometric to .
Logarithmic Sobolev inequality proven for non-compact self-shrinkers.
problem Establishing a logarithmic Sobolev inequality for non-compact self-shrinkers.
method Using Alexandrov-Bakelman-Pucci (ABP) method to prove the inequality for Euclidean space, then applying this method to non-compact self-shrinkers.
result Optimal logarithmic Sobolev inequality for complete, non-compact, properly embedded self-shrinkers.
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 …
Motivated by a remark and a question of Nicholas Katz, we characterize the tangent space of the space of Fuchsian equations with given generic exponents inside the corresponding moduli space of logarithmic connections: we construct a weight 1 Hodge structure on the tangent space of the moduli of logarithmic connections…
New flow expands hypersurfaces in hyperbolic space, showing round limiting shape for certain powers.
problem Understanding the limiting shape of hypersurfaces expanding in hyperbolic space.
method Introduced shifted inverse curvature flow with positive power for a smooth curvature function.
result For , limiting shape is always round as maximal existence time is approached.
We consider a class of overdetermined problems in rotationally symmetric spaces, which reduce to the classical Serrin's overdetermined problem in the case of the Euclidean space. We prove some general integral identities for rotationally symmetric spaces which imply a rigidity result in the case of the round sphere.
The paper ranks experts based on task performance with noisy evaluations.
problem Ranking experts based on their performance across multiple tasks with noisy evaluations.
method Develops adaptive strategies for ranking experts with a bound on the number of queries.
result Proves strategies allowing to recover the correct ranking of experts with high probability.
Theorems prove upper bounds for foliations on closed Alexandrov spaces.
problem Upper bounds for the dimension of isometry groups of metric foliations.
method Proving theorems about isometries and foliations on closed Alexandrov spaces.
result Sharp upper bounds for the dimension of the isometry group of metric foliations.
Roundness of the ample cone and existence of double Lagrangian fibrations on hyperkahler manifoldsmath.AG
Hyperkahler manifolds with round Kahler cones have unique bimeromorphic models.
problem Existence of round Kahler cones in hyperkahler manifolds.
method Analyzing the Kahler cone and its relation to the Bogomolov-Beauville-Fujiki form.
result Maximal holonomy hyperkahler manifolds with have deformations with round Kahler cones.
The study identifies surfaces with Maslovian normal bundles.
problem Characterizing surfaces with specific geometric properties.
method Proving equivalence to round spheres, cylinders, or cones.
result Surfaces with Maslovian normal bundles are limited to specific shapes.
We show that the infinite-dimensional space of Zoll Finsler metrics on the projective plane strongly deformation retracts to the canonical round metric. In particular, this space of Zoll Finsler metrics is connected. Moreover, the strong deformation retraction arises from a deformation of the geodesic flow of every Zol…
Study of foliations' geometric and topological structures.
problem Analyzing the geometric and topological properties of transversely affine foliations.
method Attach holonomy group and quotient stack, identify reparametrisations, classify them, and study the Kato-Nakayama space.
result Holonomy group controls the geometric part, while the Kato-Nakayama space captures the topological and dynamical aspects.
Eigenvalues on spheresmath.DG
Eigenvalues on spheres are compared to the unit round sphere, proving a sharp bound and equality condition.
problem Comparing eigenvalues of spheres under different metrics.
method Analyzing Laplace eigenvalues and using Alexandrov spaces.
result Equality of eigenvalues forces metrics to be isometric to the unit round sphere.
Study on infinite-dimensional Heisenberg groups using hypoelliptic heat kernels.
problem Properties of hypoelliptic heat kernels on infinite-dimensional reduced Heisenberg groups.
method Construction and study of hypoelliptic heat kernels on infinite-dimensional reduced Heisenberg groups.
result Hypoelliptic logarithmic Sobolev inequalities on the space.