Adversarial online nonparametric regression achieves optimal rates with locally adaptive learning.
problem Adversarial online nonparametric regression with general convex losses.
method Parameter-free learning algorithm leveraging chaining trees to compete against H{ö}lder functions, dynamically tracking and adapting to local smoothness variations.
result First computationally efficient algorithm with locally adaptive optimal rates for online regression in an adversarial setting.
Study approximates unknown function levels with queries.
problem Approximating unknown function levels through sequential queries.
method Introduce Bisect and Approximate algorithms to reduce to local function approximation.
result Rate-optimal sample complexity guarantees for H{ö}lder functions.
In the context of stochastic continuum-armed bandits, we present an algorithm that adapts to the unknown smoothness of the objective function. We exhibit and compute a polynomial cost of adaptation to the H{ö}lder regularity for regret minimization. To do this, we first reconsider the recent lower bound of Locatelli an…
The purpose of these notes is to explain parts of Gromov's survey of Carnot-Carathedory spaces, in the light of subsequent results of M. Rumin. Among the rich material provided by Gromov, most of which pertains to analysis on metric spaces, we choose to concentrate on the H{ö}lder equivalence problem for Carnot manifol…
Efficient algorithms for contextual bandits with smooth regret in continuous action spaces.
problem Efficient learning in large or continuous action spaces.
method Smooth regret notion and efficient algorithms for general function approximation.
result Statistically and computationally efficient algorithms for contextual bandits with smooth regret.
We find a local solution to the Ricci flow equation under a negative lower bound for many known curvature conditions. The flow exists for a uniform amount of time, during which the curvature stays bounded below by a controllable negative number. The curvature conditions we consider include 2-non-negative and weakly $\t…
A variant of Gromov's H{ö}lder-equivalence problem, motivated by a pinching problem in Riemannian geometry, is discussed. A partial result is given. The main tool is a general coarea inequality satisfied by packing energies of maps.
Study shows zero-shot super-resolution in neural operators is impossible in many cases.
problem Understanding the theoretical limits of zero-shot super-resolution in neural operators.
method Systematic theoretical study including information-theoretic and generalization bounds analysis.
result Zero-shot super-resolution is information-theoretically impossible in many settings.
This paper selects features in deep neural networks with theoretical guarantees.
problem Feature selection in deep neural networks with unknown nonlinear functions.
method Reformulate neural networks as index models, estimate feature sets using Stein's formula, and apply screening-and-selection mechanism.
result Consistent feature selection with theoretical guarantees, even in high-dimensional settings.
We study finite energy classes of quasiplurisubharmonic (qpsh) functions in the setting of toric compact K{ä}hler manifolds. We characterize toric qpsh functions and give necessary and sufficient conditions for them to have finite (weighted) energy, both in terms of the associated convex function in R n , and through t…
Let S be a closed oriented surface of genus at least 2, and denote by T(S) its Teichm{ü}ller space. For any isotopy class of closed curves γ, we compute the first three derivatives of the length function ℓ_γ:T(S)→R_+ in the shearing coordinates associated to a maxim…
We consider the problem of online nonparametric regression with arbitrary deterministic sequences. Using ideas from the chaining technique, we design an algorithm that achieves a Dudley-type regret bound similar to the one obtained in a non-constructive fashion by Rakhlin and Sridharan (2014). Our regret bound is expre…
In this paper we provide an alternative framework to tackle the first-best Principal-Agent problem under CARA utilities. This framework leads to both a proof of existence and uniqueness of the solution to the Risk-Sharing problem under very general assumptions on the underlying contract space. Our analysis relies on an…
Validates economic scenarios using statistical tests on stochastic processes.
problem Ensuring the accuracy of real-world economic scenario models.
method Applies Chevyrev and Oberhauser's (2022) signature and maximum mean distance test to various stochastic processes.
result Demonstrates the test's effectiveness across different path properties relevant to financial modeling.
New algorithms for interactive learning match minimax bounds efficiently.
problem Interactive learning in the realizable setting with computational efficiency.
method General framework, computationally efficient algorithms, Monte Carlo hit-and-run sampling.
result Sample complexities quantifiable in terms of combinatorial quantities, computationally efficient.
General lower bounds on neural network approximation in L^p norm.
problem Fundamental limits of neural network expressivity.
method General lower bound proof on approximation in L^p norm, applied to feed-forward neural networks.
result Neural networks can't approximate certain functions as well as previously thought.
Introduces a space of almost complex structures for complex Lie group bundles.
problem Integrability of almost complex structures on complex Lie group bundles.
method Introduces a space of bundle almost complex structures and studies their properties.
result Locally pseudo-holomorphic sections exist if and only if the obstruction form is zero.
Abstract reviews geometric theories of smooth and F-smooth systems.
problem Geometric theories of smooth and F-smooth systems.
method Reviews geometric theories of smooth and F-smooth systems.
result Discusses geometric theories of smooth and F-smooth systems.
Smoothly embed 3-manifolds in 5-manifolds, simplifying topological to smooth.
problem Embedding 3-manifolds smoothly in 5-manifolds.
method Homotopy and small homotopy to achieve smooth embeddings.
result Locally flat embeddings are homotopic to smooth ones.
Smooth families of biholomorphisms between strongly pseudoconvex domains are shown to be smooth.
problem Smoothness of families of biholomorphisms between strongly pseudoconvex domains.
method Riemannian geometry of Bergman metrics and smoothness of families of isometries.
result Smoothness of families of biholomorphisms between strongly pseudoconvex domains.
We prove that smooth cube manifolds have normal smooth structures.
On a compact, oriented, Riemannian manifold, the Hodge decomposition theorem associates a smooth primitive to any exact smooth form omega. In this paper, we show that given a smooth family of exact smooth forms omega(t), the family of associated primitives is also a smooth family with respect to t.
Smooth submetries between curved spaces are smooth.
problem Smoothness of submetries between curved spaces.
method Proving smoothness of submetries in a general setting, including Riemannian submersions and isometric actions.
result Smoothness of the base manifold is implied by the smoothness of the total manifold without curvature assumptions.
Estimates time-varying network connections using multi-stage smoothing.
problem Estimating edge probabilities of time-varying networks.
method Multi-stage smoothing: temporal local smoothing followed by node-domain smoothing.
result Captures both smooth temporal evolution and structural patterns in connectivity.
The paper constructs infinitely many G-smoothings of a G-manifold.
problem Constructing G-smoothings of a G-manifold. method Using controlled h-cobordisms. result Infinitely many G-smoothings of a G-manifold are constructed and are isotopic after taking a product with R. Investigates smoothness of specific algebra structures.
problem Smoothness of bi-quadratic algebras on three generators.
method Analyzes differential smoothness with PBW basis.
result Characterizes conditions for smoothness.
New smoothing techniques for topological surfaces in 4-manifolds.
problem Topological isotopy of surfaces in smooth 4-manifolds.
method Combining Quinn's smoothing theory with Gabai's light bulb theorem and other developments.
result Proves topological = smooth results for certain disks and spheres.
We define a diffeomorphism invariant of smooth 4-manifolds which we can estimate for many smoothings of R^4 and other smooth 4-manifolds. Using this invariant we can show that uncountably many smoothings of R^4 support no Stein structure. (Gompf has constructed uncountably many smoothings of R^4 which do support Stein …
The paper examines smoothness in diffusion algebra.
problem Smoothness in diffusion algebras.
method Not explicitly detailed in the abstract.
result Not explicitly detailed in the abstract.
Smooth activations enable optimal error rates in neural networks for Sobolev function classes.
problem Achieving optimal approximation and estimation error rates for neural networks in Sobolev function classes.
method Study of neural networks with smooth activations, proving optimal rates via approximation and statistical properties.
result Constant-depth networks with smooth activations achieve optimal rates of approximation and estimation, demonstrating smoothness adaptivity.
Entropy data replaces classical charts for smooth manifolds.
problem Establishing smooth structures on topological manifolds.
method Using entropy data to define admissible coordinate functions and reconstruct smooth atlases.
result Entropy-smooth structures are equivalent to classical smooth structures and stable under perturbations.
Variant of previous work on smooth algebraic functions with compact and non-compact preimages.
problem Constructing smooth algebraic functions with specific preimage properties.
method Explicit construction of smooth real algebraic functions with controlled preimage compactness.
result New results in singularity theory and real algebraic geometry.
Proof outlined for 4D smooth Poincaré conjecture.
problem 4-dimensional smooth Poincaré conjecture.
method Outline of proof.
result Proof of 4D smooth Poincaré conjecture.
Study on smoothness of special algebra types.
problem Differential smoothness of bi-quadratic algebras with PBW basis.
method Investigation of algebra properties.
result Results on differential smoothness.
The study bounds and characterizes surfaces containing smooth conics and twistor fibers in a flag threefold.
problem Bounding and characterizing surfaces containing smooth conics and twistor fibers in a flag threefold.
method Analyzing the family of smooth conics and using algebraic properties to construct surfaces.
result The only smooth cases of surfaces containing infinitely many twistor fibers are of bidegree (1,1).
In this note we introduce the notion of a smooth structure on a conical pseudomanifold M in terms of C∞-rings of smooth functions on M. For a finitely generated smooth structure C∞(M) we introduce the notion of the Nash tangent bundle, the Zariski tangent bundle, the tangent bundle of M, and the …
The paper examines smoothness in graded skew Clifford algebras.
problem Smoothness of graded skew Clifford algebras.
method Investigation of differential smoothness.
result Results on the differential smoothness of graded skew Clifford algebras.
Kontsevich's classes distinguish smooth structures on fiber bundles.
problem Distinguishing smooth structures on fiber bundles.
method Using Kontsevich's characteristic classes and real blow-up construction.
result Kontsevich's classes are determined by the topology of the 2-point configuration space bundle.
Label smoothing improves model performance even with noisy labels.
problem Mitigating label noise in deep learning models.
method Examined label smoothing as a technique to cope with label noise and compared it to loss-correction methods.
result Label smoothing is competitive with loss-correction techniques under label noise and beneficial for distillation from noisy data.
We construct an analytic multiplicative model of smooth K-theory. We further introduce the notion of a smooth K-orientation of a proper submersion and define the associated push-forward which satisfies functoriality, compatibility with pull-back diagrams, and projection and bordism formulas. We construct a multiplicati…
Theory of smooth relative connections on quiver bundles developed.
problem Existence of smooth relative connections over quiver bundles.
method Developed a theory over RQ on smooth twisted quiver bundles, provided obstructions and necessary/sufficient conditions. result Established a necessary and sufficient condition for the existence of smooth relative connections on tree-type quiver bundles.
New smooth models for string groups defined in ∞-categories.
problem Defining string group models in smooth spaces.
method Homotopy-theoretic definition using singular complex functor.
result New smooth models for the string group.
Adapts Hölder smoothness with normalized gradients.
problem Improving smoothness adaptation methods.
method Black-box adaptation of Levy's method using normalized gradients.
result Bound depends on local Hölder smoothness.
We prove that any isometry between the unit spheres of C2-smooth (more generally, absolutely smooth) smooth Banach spaces extends to a linear isometry of the Banach spaces. This answers the famous Tingley's problem in the class of absolutely smooth 2-dimensional Banach spaces.
We show that every smooth manifold admits a smooth triangulation transverse to a given smooth map. This removes the properness assumption on the smooth map used in an essential way in Scharlemann's construction [5].
Smooth actions of cyclic groups on 3-manifolds are conjugate to smooth ones.
problem Understanding smoothness in group actions on 3-manifolds.
method Finite cyclic group actions by (1+ε)-bilipschitz homeomorphisms on closed 3-manifolds. result Finite cyclic group actions by (1+ε)-bilipschitz homeomorphisms on closed 3-manifolds are conjugate to smooth actions. Confirming operator characterization on smooth manifolds.
problem Characterizing an operator on smooth sections of tangent bundles.
method Using algebraic axioms and H^1(M, R) = {0} assumption.
result Operator can be characterized universally for any smooth manifold.
Smooth Schrödinger Bridges improve trajectory inference by smoothing Gaussian processes.
problem Improving trajectory inference in applications like particle tracking.
method Generalizes Schrödinger Bridge problem to smooth Gaussian processes, solving the problem on phase space.
result The method outperforms existing methods on real datasets.