Study rigidity by logarithmic capacity and related functions.
problem Rigidity phenomena in kernel functions and capacities.
method Exploration of Bergman kernel, logarithmic capacity, Green's function, and Euclidean distance/volume.
result Established rigidity theorems by logarithmic capacity.
New MD algorithms using Tempesta logarithms for machine learning.
problem Optimization in machine learning with tailored hyperparameters.
method Developed Mirror Descent algorithms using Tempesta multi-parametric logarithms.
result Wide and flexible family of Mirror Descent and mirror-less updates.
New algorithm achieves logarithmic regret for adversarial online control.
problem Online linear-quadratic control in systems with adversarial disturbances.
method Characterization of optimal offline control law, reduced to online learning with approximate advantage functions.
result First algorithm with logarithmic regret for arbitrary adversarial disturbance sequences.
Logarithmic regret achieved in RL with linear function approximation.
problem Achieving logarithmic regret in reinforcement learning with linear function approximation.
method LSVI-UCB for linear MDP assumption, UCRL-VTR for linear mixture MDP assumption.
result Logarithmic regret bounds established for RL with linear function approximation.
Through the main example of the Ornstein-Uhlenbeck semigroup, the Bakry-Emery criterion is presented as a main tool to get functional inequalities as Poincaré or logarithmic Sobolev inequalities. Moreover an alternative method using the optimal mass transportation, is also given to obtain the logarithmic Sobolev inequa…
In this paper we introduce a new logarithmic entropy functional for the linear heat equation on complete Riemannian manifolds and prove that it is monotone decreasing on complete Riemannian manifolds with nonnegative Ricci curvature. Our results are simpler version, without Ricci flow, of R.-G. Ye's recent result (arXi…
Study geodesic curvature of logarithmic spirals on curved surfaces.
problem Understanding geodesic curvature on curved surfaces.
method Computed geodesic curvature of logarithmic spirals on surfaces of constant Gaussian curvature.
result Asymptotic behavior of geodesic curvature is independent of the ambient surface's curvature.
Solutions near infinity to special Lagrangian equations are asymptotic to quadratic polynomials with logarithmic terms.
problem Solving special Lagrangian equations near infinity with specific conditions.
method Modified Kelvin transforms to characterize remainders in asymptotic expansions.
result Remainders in asymptotic expansions are characterized by a single smooth function in even dimensions and Cn−1,α in odd dimensions. New rigidity found for 3D warped product domains.
problem Finding rigidity conditions for warped product domains.
method Developed scalar curvature rigidity for a general class of domains.
result Identified domains satisfying a boundary condition analogous to logarithmic concavity.
We investigate optimal consumption problems for a Black-Scholes market under uniform restrictions on Value-at-Risk and Expected Shortfall for logarithmic utility functions. We find the solutions in terms of a dynamic strategy in explicit form, which can be compared and interpreted. This paper continues our previous wor…
The study examines correlations of logarithms of integers at different scalings.
problem Analyzing pair correlations of logarithms of integers at various scalings.
method Examined correlations of logarithms of positive integers at different scalings, proving the existence of pair correlation functions.
result Level repulsion at linear scaling, total loss of mass at superlinear scalings, and Poissonian behavior at sublinear scalings.
Lueck expressed the Gromov norm of a knot complement in terms of an infinite series that can be computed from a presentation of the fundamental group of the knot complement. In this note we show that Lueck's formula, applied to torus knots, yields surprising power series expansions for the logarithm function. This gene…
Near-logarithmic regret per switch achieved for mixable/exp-concave losses.
problem Online optimization of mixable loss functions with dynamic environments.
method Online mixture framework using static solvers and hyper-expert creations.
result Near-logarithmic regret per switch with sub-polynomial complexity.
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.
Consider the one-parameter generalizations of the logarithmic and exponential functions which are obtained from the integration of non-symmetrical hyperboles. These generalizations coincide to the one obtained in the context of non-extensive thermostatistics. We show that these functions are suitable to describe and un…
The paper explores the geometric structure of cost functions in multiple dimensions.
problem Understanding the geometric properties of cost functions in multidimensional settings.
method Analyzes the Hessian metric and geodesics in logarithmic and original coordinates.
result The geometry is one-dimensional in logarithmic coordinates but effectively (n−1)-dimensional in original coordinates. Improved activation function NLReLU boosts neural network performance.
problem Performance issues with ReLU activation function.
method NLReLU uses parametric natural logarithmic transform to improve ReLU.
result NLReLU provides higher accuracy than ReLU in various neural networks.
New framework reduces minimax regret for high-dimensional data.
problem Minimizing regret in high-dimensional data with logarithmic loss.
method Developed envelope complexity framework and spike-and-tails prior.
result Achieves minimax regret within a factor of two over high-dimensional ℓ1-balls. Paper proposes efficient cost functions for automated market makers in DeFi.
problem Inefficient and computationally complex cost functions in DeFi.
method Proposes and analyzes constant circle/ellipse based cost functions.
result Proposed cost functions are computationally efficient and robust against attacks.
The study of harmonic diffeomorphisms reduces to solving a specific Beltrami equation.
problem Classifying harmonic diffeomorphisms between surfaces.
method Reduction to solving a Beltrami equation and an elliptic sinh-Gordon equation.
result Solutions to the sinh-Gordon equation classify harmonic maps.
New construction for surfaces with logarithmically large systoles.
problem Bounding the systole of hyperbolic surfaces.
method Combining graph constructions and matrix counting.
result Constructs surfaces with logarithmically large systoles.
The paper proves the concavity of p-entropy power and applies it to functional inequalities.
problem Proving concavity of p-entropy power on Riemannian manifolds. method Analyzing the p-heat equation on closed Riemannian manifolds with nonnegative Ricci curvature. result New proofs and improvements of Lp-Euclidean Nash and Logarithmic Sobolev inequalities. Optimal unimodal fitting for linear loss functions in a sequential, efficient manner.
problem Optimal unimodal transformation of univariate model scores under linear loss functions.
method Proposes a sequential approach to estimate the optimal rectangular fit for observed samples with each new sample.
result Sequential approach achieves optimal efficiency with logarithmic time complexity per iteration.
Long systoles form pants decompositions on hyperbolic surfaces.
problem Constructing hyperbolic surfaces with long systoles.
method Construction of sequences of closed hyperbolic surfaces.
result Systoles form pants decompositions and their length grows logarithmically with genus.
New loss function helps learn unstable dynamical systems.
problem Gradient descent fails to learn unstable dynamical systems.
method Introduced a time-weighted logarithmic loss function.
result Time-weighted loss function effectively learns unstable systems.
Study bounds for Brownian motion on manifolds with sticky boundary conditions.
problem Proving geometric bounds for Brownian motion on manifolds with sticky boundary conditions.
method Interpolation involving energy interactions between boundary and interior of the manifold.
result Explicit geometric bounds on Steklov eigenvalues, boundary trace operators, and boundary trace logarithmic Sobolev constants.
Logarithmic regret achieved in Q-learning with positive gap.
problem Achieving logarithmic cumulative regret in Q-learning with positive sub-optimality gap.
method Optimistic Q-learning with logarithmic regret bound.
result Logarithmic cumulative regret bound proven for optimistic Q-learning.
Research examines correlations of complex logarithms of lattice points, showing level repulsion and Poissonian behavior.
problem Analyzing correlations of complex logarithms of lattice points.
method Proving existence of pair correlation functions and examining behavior at various scalings.
result Level repulsion observed at linear scaling, Poissonian behavior at sublinear scalings.
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…
Paper analyzes and improves adaptive gradient methods for optimization.
problem Improving optimization methods for deep neural networks.
method Analyzes and proposes variants of RMSProp and Adagrad for online convex optimization.
result Proposes SC-Adagrad and SC-RMSProp with logarithmic regret bounds for strongly convex functions.
New algorithm proves deep networks can learn better than shallow ones.
problem Understanding the power difference between shallow and deep neural networks.
method Identifying a class of Boolean functions and proving that logarithmic-depth networks can learn them efficiently using hierarchical reconstruction.
result First algorithmic separation between constant-depth and logarithmic-depth neural networks.
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 O(ηlog(NRT)⋅dR) logarithmic regret bound. Proves inequality for special 3D shapes, generalizing to non-symmetric ones.
problem Proving a mathematical inequality for specific 3D shapes.
method Operator theoretic approach combined with spherical function decomposition.
result Generalized inequality for non-symmetric bodies of revolution.
Logarithmic pruning simplifies lottery ticket hypothesis.
problem Finding efficient subnetworks in large neural networks.
method Logarithmic pruning approach to identify subnetworks.
result Randomly initialized subnetworks achieve comparable performance.
Study optimal investment and consumption in financial markets using Ornstein-Uhlenbeck process.
problem Optimal consumption/investment problem in financial markets with logarithmic utility.
method Stochastic dynamical programming method and Hamilton-Jacobi-Bellman (HJB) equation.
result Explicit solution to the HJB equation and optimal financial strategies constructed.
New optimal portfolios derived for power and logarithmic utilities under log-normal returns.
problem Optimal portfolio weights for power and logarithmic utilities under log-normal returns.
method Closed-form expressions derived for optimal portfolio weights, proving mean-variance efficiency.
result Both optimal portfolios are mean-variance efficient and belong to the feasible set.
Derives gradient estimate for a specific nonlinear parabolic equation on Finsler manifolds.
problem Derives gradient estimate for a nonlinear parabolic equation on Finsler manifolds.
method Leverages a new Laplacian comparison theorem to derive a Li-Yau type gradient estimate.
result Establishes a Li-Yau type gradient estimate for the Finslerian logarithmic Schrödinger equation.
Study Kähler-Einstein potentials on stable varieties near singularities
problem Asymptotic behavior of Kähler-Einstein potentials on stable varieties near singularities
method Using iterated logarithmic functions and refined lower bounds
result Improved estimates for Kähler-Einstein potentials
Random surfaces with long systoles created from graph theory ideas.
problem Finding surfaces with long systoles.
method Two constructions inspired by graph theory.
result Proved a new lower bound on systole length.
The paper proves curvature rigidity for manifolds with specific scalar curvature bounds.
problem Curvature rigidity of manifolds with scalar curvature constraints.
method Power series expansions of logarithmic Sobolev and W-functionals, scalar curvature bounds, and isoperimetric profiles.
result The sectional curvature of a manifold is constant (K) if it satisfies scalar curvature and isoperimetric conditions.
Study functional inequalities on non-reversible Finsler manifolds.
problem Functional inequalities on non-reversible Finsler manifolds.
method Application of Bochner inequality and Γ-calculus.
result Dimensional versions of Poincare--Lichnerowicz, logarithmic Sobolev, and Sobolev inequalities hold for non-reversible metrics.
Quantum computing speeds up training Gaussian processes exponentially.
problem Training Gaussian processes efficiently.
method Quantum algorithms for computing the logarithm of the determinant and matrix inversion.
result Exponential improvement in estimating the marginal likelihood of Gaussian processes.
In this note, we derive the characteristic function expansion for logarithm of the underlying asset price in corrected Heston model as proposed by Fouque and Lorig.
In this paper we introduce the log entropy functional and establish its monotonicity along the Ricci flow. One consequence of it is the monotonicity of the logarithmic Sobolev constant along the Ricci flow.
The paper addresses portfolio allocation with uncertain covariance matrices, finding a logarithmic risk dependence.
problem Portfolio allocation with uncertain covariance matrices.
method Calculates the expected value of CARA utility function over a distribution of covariance matrices, considering uncertainty in future returns and covariances.
result Marginalization introduces a logarithmic dependence on risk, leading to lower allocation levels for higher uncertainties.
Let G be a Lie Group with a left invariant connection such that its connection function is skew-symmetric. Our main goal is to show a version of Pluzhnikov's Theorem for this kind of connection. To this end, we use the stochastic logarithm. More exactly, the stochastic logarithm gives characterizations for Brownian m…
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.
We prove the existence of plurisubharmonic functions with prescribed logarithmic singularities on complex 3-folds equipped with a nef class of positive volume. We prove the same result for rational classes on Moishezon n-folds.