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.

169,181 papers · 148 categories

Trend · papers per month

162324486648 · Jun 202019922001200920182026
48 results for quasi-concave functions

Paper develops a robust preference model for multi-attribute choices.

problem Ambiguity in multi-attribute choice functions.
method Pairwise comparisons for preference elicitation, robust optimization model based on worst-case choice function.
result Developed tractable formulations for robust preference optimization.

Paper develops new methods for binary classification with complex performance measures.

problem Complex performance measures in binary classification are not decomposable and require new theoretical and methodological developments.
method Identifies Karmic and threshold-quasi-concavity properties, and develops a computationally practical plug-in classifier.
result Bayes optimal classifier is a threshold function of conditional probability, leading to practical classification error analysis.

We define Conditional quasi concave Performance Measures (CPMs), on random variables bounded from below, to accommodate for additional information. Our notion encompasses a wide variety of cases, from conditional expected utility and certainty equivalent to conditional acceptability indexes. We provide the characteriza…

2012-12-17abs ↗pdf ↗

This paper characterizes and designs loss functions for robust classification with abstention.

problem Ensuring robustness against adversarial attacks and knowing when to abstain from prediction.
method Proposes adversarial robust reject option loss and characterizes surrogates for calibration.
result Shifted Double Ramp Loss and Shifted Double Sigmoid Loss satisfy the calibration conditions.

We present a framework and analysis of consistent binary classification for complex and non-decomposable performance metrics such as the F-measure and the Jaccard measure. The proposed framework is general, as it applies to both batch and online learning, and to both linear and non-linear models. Our work follows recen…

2016-10-23abs ↗pdf ↗

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.

Analyzes properties of transnormal Finsler functions on compact manifolds.

problem Properties of transnormal Finsler functions on compact manifolds.
method Analyzes critical level sets and partition properties of transnormal functions.
result Critical level sets of an analytic transnormal function are submanifolds, and the partition of MM into level sets is a Finsler partition.

The study explores the Dehn functions of Kähler groups and their properties.

problem Which functions can arise as Dehn functions of Kähler groups?
method Analyzes examples of Kähler groups with various Dehn functions and proves the existence of a Kähler group with a cubic bounded Dehn function.
result There exists a Kähler group with a cubic bounded Dehn function and an exponential upper bound.

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 extends mixability theory to function-valued forecasts, proving various loss functions are mixable.

problem Efficient aggregation of functional and probabilistic forecasts in online prediction games.
method Adapting mixable and exponentially concave loss functions to function-valued forecasts.
result Various loss functions used for probabilistic forecasting are mixable (exp-concave).

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.

Deep neural networks with various activation functions can approximate Hölder smooth functions.

problem Expressivity of deep neural networks with general activation functions.
method Investigates approximation ability of deep neural networks with a broad class of activation functions, including Hölder smooth functions.
result Derives the required depth, width, and sparsity of deep neural networks to approximate Hölder smooth functions.

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.

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.

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.

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.

A novel likelihood function for MRFs approximates marginal likelihoods and uses copulas to reconstruct the joint likelihood.

problem Intractable partition function for MRF likelihoods.
method Approximate marginal likelihoods through a modified coin-tossing scenario, then reconstruct the joint likelihood using copulas.
result Our approach outperforms Laplace approximation and pseudolikelihood, especially as MRF size increases.

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.

Defines new geodesic semilocal E-preinvex functions and studies their properties.

problem Defines new functions to generalize existing convex and preinvex concepts.
method Introduces geodesic semilocal E-preinvex functions and proves their properties.
result Establishes sufficient optimality conditions for nonlinear fractional multiobjective programming.