arXiv research

New findings show infinitely many knots cannot be smoothly round handle slices.

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…

In the present paper, we study deformations of polar weighted homogeneous polynomials which are also polar weighted homogeneous polynomials. We describe a round handle decomposition of the Milnor fibration of a deformation of a polar weighted homogeneous polynomial concretely and give the number of round handles by the…

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…

Classifies symplectic fillings of specific torus bundles.

We show how to construct broken, achiral Lefschetz fibrations on arbitrary smooth, closed, oriented 4-manifolds. These are generalizations of Lefschetz fibrations over the 2-sphere, where we allow Lefschetz singularities with the non-standard orientation as well as circles of singularities corresponding to round 1-hand…

Paper generalizes reward distribution in multi-armed bandits with temporally-partitioned rewards.

The topology of broken Lefschetz fibrations is studied by means of handle decompositions. We consider a slight generalization of round handles, and describe the handle diagrams for all that appear in dimension four. We establish simplified handlebody and monodromy representations for a certain subclass of broken Lefsch…

New algorithm reduces heavy-tailed linear bandits' computational cost.

We present an adaptive online gradient descent algorithm to solve online convex optimization problems with long-term constraints , which are constraints that need to be satisfied when accumulated over a finite number of rounds T , but can be violated in intermediate rounds. For some user-defined trade-off parameter $β$…

Improved algorithm reduces communication rounds for distributed online learning.

We develop a construction of Engel stuctures on 4-manifolds based on decompositions of manifolds into round handles. This allows us to show that all parallelizable 4-manifolds admit an Engel structure. We also show that, given two Engel manifolds M_1,M_2 satisfying a certain condition on the characteristic foliation, t…

Proves uniqueness of blowups for forced mean curvature flow.

A new approach for cooperative multi-agent reinforcement learning with limited communication, reducing the number of communication rounds.

New algorithms solve nonconvex federated learning problems efficiently.

New methods handle both data and network heterogeneity in federated learning.

New method achieves near-optimal regret without simulator.

In recent years, content recommendation systems in large websites (or \emph{content providers}) capture an increased focus. While the type of content varies, e.g.\ movies, articles, music, advertisements, etc., the high level problem remains the same. Based on knowledge obtained so far on the user, recommend the most d…

To deal with changing environments, a new performance measure -- adaptive regret, defined as the maximum static regret over any interval, was proposed in online learning. Under the setting of online convex optimization, several algorithms have been successfully developed to minimize the adaptive regret. However, existi…

New algorithm for nonstationary GLBs reduces computation and memory costs.

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

Secure aggregation for buffered asynchronous federated learning without TEEs.

Round surgery diagrams represent 3-manifolds in $S^3$.

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

Warped DLMs improve forecasting for count time series.

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 …

New framework guides resource usage to achieve sublinear regret in adversarial settings.

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

For each integer $k \geq 2$, we apply gluing methods to construct sequences of minimal surfaces embedded in the round $3$-sphere. We produce two types of sequences, all desingularizing collections of intersecting Clifford tori. Sequences of the first type converge to a collection of $k$ Clifford tori intersecting with …

Deep neural networks have enabled progress in a wide variety of applications. Growing the size of the neural network typically results in improved accuracy. As model sizes grow, the memory and compute requirements for training these models also increases. We introduce a technique to train deep neural networks using hal…

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…

We discuss the integrability of orthogonal almost complex structures on Riemannian products of even-dimensional round spheres and give a partial answer to the question raised by E. Calabi concerning the existence of complex structures on a product manifold of a round 2-sphere and a round 4-sphere.

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

We consider the problem of online multiclass classification with partial feedback, where an algorithm predicts a class for a new instance in each round and only receives its correctness. Although several methods have been developed for this problem, recent challenging real-world applications require further performance…

New framework handles online decisions with replenishable resources, improving both adversarial and stochastic performance.

New findings on $κ$-solutions with round cylinder as asymptotic shrinker.

Round balls minimize liquid drop model volumes ≤ 1.

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

Round cylinders are rigid in Ricci shrinkers close to the standard product.

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.

We show that if the entropy of any closed hypersurface is close to that of a round hyper-sphere, then it is close to a round sphere in Hausdorff distance. Generalizing the result of \cite{BW1} to higher dimensions.

In this paper, we study the limiting behavior of the Brown-York mass and Hawking mass along nearly round surfaces at infinity of an asymptotically flat manifold. Nearly round surfaces can be defined in an intrinsic way. Our results show that the ADM mass of an asymptotically flat 3-manifold can be approximated by some …

The study characterizes round spheres in Euclidean space based on 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…

Proposes a new acquisition function for batched Bayesian optimization.

In recent work, the notion of Double Convexity for a foliation of a conical null hypersurface was introduced to give a proof, if satisfied, of the Null Penrose Inequality. Double Convexity constrains the geometry of a Marginally Outer Trapped Surface (MOTS), called a quasi-round MOTS. In the first part of this paper, f…

Paper improves sparse linear bandits by accounting for noise variance.

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