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.

168,742 papers · 148 categories

Trend · papers per month

162324486648 · Jun 202019922001200920172026
48 results for g-convex functions

Geodesic convexity generalizes the notion of (vector space) convexity to nonlinear metric spaces. But unlike convex optimization, geodesically convex (g-convex) optimization is much less developed. In this paper we contribute to the understanding of g-convex optimization by developing iteration complexity analysis for …

2016-02-19abs ↗pdf ↗

New methods optimize functions on hyperbolic and spherical spaces, matching Euclidean rates up to logarithmic factors.

problem Optimizing functions on non-Euclidean spaces like hyperbolic and spherical geometries.
method Introduced accelerated global first-order methods for LL-smooth and geodesically convex functions on hyperbolic and spherical spaces.
result Achieved the same rates as accelerated gradient descent in Euclidean space, up to logarithmic factors.

This is an essay on potential theory for geometric plurisubharmonic functions. It begins with a given closed subset G of the Grassmann bundle G(p,TX)G(p,TX) of tangent pp-planes to a riemannian manifold XX. This determines a nonlinear partial differential equation which is convex but never uniformly elliptic (p < dim X). …

2011-11-16abs ↗pdf ↗

Lower bounds for geodesically convex optimization show curvature negatively impacts complexity.

problem Understanding the impact of curvature on the query complexity of geodesically convex optimization.
method Building on recent lower bounds, the study proposes and proves new lower bounds for various settings of geodesically convex optimization.
result Negative curvature is detrimental to the complexity of geodesically convex optimization.

New method for optimization on Hadamard manifolds with curvature-independent guarantees.

problem Curvature-dependent complexity in geodesic convex optimization.
method Introducing horospherical convexity and developing algorithms for optimization.
result Curvature-independent convergence of subgradient descent and Nesterov's method.

New method optimizes on curved manifolds without curvature dependence.

problem Curvature-dependent regret in online optimization on Hadamard manifolds.
method Riemannian online gradient descent for h-convex functions.
result Established O(T)O(\sqrt{T}) and O(log(T))O(\log(T)) regret guarantees, curvature-independent.

Developing efficient and guaranteed nonconvex algorithms has been an important challenge in modern machine learning. Algorithms with good empirical performance such as stochastic gradient descent often lack theoretical guarantees. In this paper, we analyze the class of homotopy or continuation methods for global optimi…

2016-10-28abs ↗pdf ↗

Graphs are naturally sparse objects that are used to study many problems involving networks, for example, distributed learning and graph signal processing. In some cases, the graph is not given, but must be learned from the problem and available data. Often it is desirable to learn sparse graphs. However, making a grap…

2017-08-29abs ↗pdf ↗

Study exact minimax rates for density estimation over convex classes, extending previous work.

problem Deriving minimax rates for density estimation over convex density classes.
method Building on Le Cam's work, determine exact minimax rates using local metric entropy.
result Exact minimax rates derived for any convex density class, including nonparametric and parametric cases.

In classification, the de facto method for aggregating individual losses is the average loss. When the actual metric of interest is 0-1 loss, it is common to minimize the average surrogate loss for some well-behaved (e.g. convex) surrogate. Recently, several other aggregate losses such as the maximal loss and average t…

2018-11-01abs ↗pdf ↗

This paper tackles convex-submodular minimax problems in mixed continuous-discrete domains.

problem Convex-submodular minimax problems in mixed continuous-discrete domains.
method Introduces new notions of optimality and proposes iterative algorithms combining discrete and continuous optimization.
result Characterizes convergence rates, computational complexity, and quality of solutions for convex and monotone-submodular minimax problems.

Develops methods for selecting and estimating smooth functional coefficients in high-dimensional multivariate functional data.

problem Functional predictor selection and estimation of smooth functional coefficients in high-dimensional multivariate functional data.
method Functional group-sparse regression methods in a generic Hilbert space of infinite dimension.
result Consistency of estimation and selection (oracle property) under infinite-dimensional Hilbert spaces.

FFBO optimizes functions as inputs and outputs, improving on existing BO methods.

problem Optimizing functions as both inputs and outputs in complex systems.
method Function-on-function Gaussian process (FFGP) model with a separable operator-valued kernel, scalar upper confidence bound (UCB) acquisition function, and scalable functional gradient ascent algorithm (FGA).
result FFBO outperforms existing methods in synthetic and real-world data.

Chirped sinosoids and interferometric phase plots are functions that are not periodic, but are the composition of a smooth function and a periodic function. These functions functions factor into a pair of maps: from their domain to a circle, and from a circle to their codomain. One can easily imagine replacing the circ…

2015-01-25abs ↗pdf ↗

The Fridman function is bounded by the injectivity radius for certain hyperbolic manifolds.

problem Bounding the Fridman function for hyperbolic manifolds.
method Analyzing the relationship between the Fridman function and the injectivity radius function.
result The Fridman function is bounded above by the injectivity radius function for certain hyperbolic manifolds.

The paper proves isoparametric functions on Finsler space forms under specific conditions.

problem Understanding isoparametric functions in Finsler space forms.
method Proving transnormal functions as isoparametric functions and constructing global and local isoparametric functions using the distance function.
result Generalization of Theorem B to Finsler space forms.

Paper introduces a nonparametric functional graphical model for random functions.

problem Estimating probabilistic conditional independence in functional graphical models.
method Functional sufficient dimension reduction to relax Gaussian or copula Gaussian assumptions.
result Enhances estimation accuracy and retains probabilistic conditional independence.

Robustifies elicitable functionals to handle small distribution misspecifications.

problem Determining uniquely optimal forecasts under distributional misspecification.
method Integrates statistical robustness into elicitable functionals using Kullback-Leibler divergence.
result Robust elicitable functionals admit unique solutions at the boundary of uncertainty regions.

The paper characterizes strong Hamel functions using symmetries and proves their preservation properties.

problem Characterizing strong Hamel functions and their symmetries in Finsler spaces.
method Analyzing geodesic spray, strong dual symmetries, and strong dynamical symmetries.
result Strong Hamel functions can be characterized in terms of strong dual symmetries and strong dynamical symmetries.

Two new methods improve forecasting of functional time series data.

problem Forecasting of functional time-dependent data.
method Functional Singular Spectrum Analysis (FSFA) based forecasting methods.
result Our methods outperform existing algorithms for periodic stochastic processes.

Study stabilizers of smooth functions on surfaces, focusing on Morse-Bott functions.

problem Understanding the homotopy type of stabilizers of smooth functions on surfaces.
method Analyzing the homotopy properties of stabilizers for a specific class of smooth functions.
result The homotopy type of the connected component of the identity map of the stabilizer is completely described for Morse-Bott functions.

The paper connects convex functions to p-subharmonic functions and proves their equivalence.

problem Understanding the relationship between convex functions and p-subharmonic functions.
method Average principle, variational methods, and PDE techniques.
result Convex functions on R^n are p-subharmonic for every p > 1.

A new deep neural network tackles nonlinear functional regression with improved dimensionality reduction.

problem Nonlinear functional regression in infinite-dimensional functional data analysis.
method Functional deep neural network with adaptive kernel embedding and projection steps.
result Explicit rates of approximating nonlinear smooth functionals are derived, and the network is shown to be effective in both simulated and real datasets.

New model for network analysis using functional data.

problem Existing network models treat nodes as functions, but this paper introduces functional edges.
method Transform adjacency matrix into functional adjacency tensor, apply Tucker decomposition, regularize basis matrices, and solve tensor completion problem.
result The model effectively captures community structure and handles irregular functional edge data.

The study finds a special type of smooth function on connected sums of manifolds.

problem Finding smooth functions that are Morse on preimages of non-extrema values.
method Investigates internally Morse (I-Morse) and neat with respect to Reeb graph (N-Reeb) functions.
result Constructs an IN-Morse-Reeb function on a connected sum of given manifolds.

NeuTSFlow models continuous functions behind time series forecasting.

problem Forecasting treats time series as discrete sequences, ignoring their continuous nature.
method NeuTSFlow uses Neural Operators to learn the transition between historical and future function families.
result NeuTSFlow outperforms traditional methods in forecasting accuracy and robustness.

New spectral functionals for Dirac operators with inner fluctuations computed.

problem Spectral functionals and Dirac operators with inner fluctuations.
method Extension of spectral functionals for Dirac operators with inner fluctuations.
result Computed spectral Einstein functional for Dirac operator with inner fluctuations on even-dimensional spin manifolds.

Regularizers change the geometric properties of loss functions in neural networks.

problem Understanding how different regularizers affect the geometric properties of loss functions in neural networks.
method Examined several regularizers, including weight decay, to determine if the regularized loss function becomes Morse.
result For certain regularizers, the regularized loss function becomes Morse, indicating a change in geometric properties.

Proposes an L1-regularized functional SVM for binary classification with functional covariates.

problem Binary classification with multivariate functional covariates.
method L1-regularized functional support vector machine (SVM) with an accompanying algorithm.
result The proposed classifier performs well in prediction and feature selection.