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,695 papers · 148 categories

Trend · papers per month

3236479701,293 · Jun 202019922001200920172026
48 results for Functional approach

A new method for incorporating preferences in multi-objective Bayesian optimization.

problem Incorporating preferences in computationally expensive multi-objective optimization problems.
method Building independent surrogate models on each objective function and using Generalised value distribution to approximate the scalarizing function.
result The proposed multi-surrogate approach outperforms the mono-surrogate approach on benchmark and real-world problems.

Proposes a deep neural network for multi-dimensional functional data classification.

problem Classifying multi-dimensional functional data with non-Gaussian distributions.
method Trains a deep neural network on the principle components of the training data.
result FDNN achieves minimax optimality when log density ratio has a locally connected modular structure.

In this paper, a new approach of defining Steiner symmetrization of coercive convex functions is proposed and some fundamental properties of the new Steiner symmetrization are proved. Further, using the new Steiner symmetrization, we give a different approach to prove a functional version of the Blaschke-Santalo inequa…

2014-03-03abs ↗pdf ↗

New method optimizes portfolio weights as functions, outperforming traditional approaches.

problem Optimizing portfolio weights in mean-variance models.
method Functional optimization approach, treating weights as functions of past values.
result Gradient-ascent algorithms can solve functional optimization problems for mean-variance portfolio management.

Due to the intractable partition function, the exact likelihood function for a Markov random field (MRF), in many situations, can only be approximated. Major approximation approaches include pseudolikelihood and Laplace approximation. In this paper, we propose a novel way of approximating the likelihood function throug…

2018-03-27abs ↗pdf ↗

Proposes a method to estimate functional graphical models from multivariate random functions.

problem Estimating conditional independence structure of multivariate random functions.
method Neighborhood selection approach combining function-on-function regression and graph recovery.
result Statistical consistency of the method in high-dimensional settings.

Imitation Learning describes the problem of recovering an expert policy from demonstrations. While inverse reinforcement learning approaches are known to be very sample-efficient in terms of expert demonstrations, they usually require problem-dependent reward functions or a (task-)specific reward-function regularizatio…

2019-06-19abs ↗pdf ↗

Unified framework for Bayesian PDE-constrained inversion using physics-informed neural networks.

problem Incorporating prior distributions in function space into Bayesian PINN-based inversion.
method Functional-prior-based approaches (fpBPINN) to Bayesian PDE-constrained inversion using physics-informed neural networks (PINNs). Two complementary approaches: FPI-BPINN and fParVI-PINN.
result Accurate estimation of posterior distributions in seismic traveltime tomography and Darcy-flow permeability inversion.

The study proves a quantitative functional CLT for neural networks with smooth activation functions.

problem Understanding the convergence rates of neural networks with different activation functions.
method Functional versions of the Stein-Malliavin approach and a quantitative functional central limit theorem.
result Rates of convergence depend on the smoothness of the activation function, ranging from logarithmic to sqrt(n).

We discuss the nature of structure-preserving maps of varies function algebras. In particular, we identify isomorphisms between special Colombeau algebras on manifolds with invertible manifold-valued generalized functions in the case of smooth parametrization. As a consequence, and to underline the consistency and vali…

2010-10-18abs ↗pdf ↗

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.

The problem of multilabel classification when the labels are related through a hierarchical categorization scheme occurs in many application domains such as computational biology. For example, this problem arises naturally when trying to automatically assign gene function using a controlled vocabularies like Gene Ontol…

2012-05-09abs ↗pdf ↗

The paper proposes methods to find a shared active subspace for multivariate vector-valued functions.

problem Minimizing the deviation between function evaluations in the original and reconstructed spaces.
method Manipulating gradients or SPD matrices to identify a shared structure.
result Summing SPD matrices often identifies the best shared active subspace.

We consider optimization of composite objective functions, i.e., of the form f(x)=g(h(x))f(x)=g(h(x)), where hh is a black-box derivative-free expensive-to-evaluate function with vector-valued outputs, and gg is a cheap-to-evaluate real-valued function. While these problems can be solved with standard Bayesian optimization, we…

2019-06-04abs ↗pdf ↗

This paper extends semi-structured networks to functional data.

problem Maintaining interpretability in functional data analysis while capturing non-linearities and interactions.
method Proposes a functional SSN method that scales well and improves predictive performance.
result The functional SSN method accurately recovers underlying signals and performs favorably compared to competing methods.

Bayesian optimization (BO) and its batch extensions are successful for optimizing expensive black-box functions. However, these traditional BO approaches are not yet ideal for optimizing less expensive functions when the computational cost of BO can dominate the cost of evaluating the blackbox function. Examples of the…

2018-11-05abs ↗pdf ↗

Enhanced tree-based classifiers use derivatives and geometry for better function classification.

problem Improving classification of high-dimensional time series data.
method Integrates Functional Data Analysis with tree-based ensemble techniques, leveraging derivative and geometric features.
result Significant improvements over traditional approaches in function classification.

Unified theory for representation learning using learnable functions.

problem Insufficient theoretical understanding of unsupervised and self-supervised learning.
method Discriminative theoretical framework for analyzing sample complexity.
result Learnable regularization functions can reduce the amount of labeled data needed.

Bayesian optimization is a sample-efficient approach to global optimization that relies on theoretically motivated value heuristics (acquisition functions) to guide its search process. Fully maximizing acquisition functions produces the Bayes' decision rule, but this ideal is difficult to achieve since these functions …

2018-05-25abs ↗pdf ↗

New simulations advise caution in choosing principal components for multivariate functional data.

problem Inaccurate selection of principal components in multivariate functional data.
method Extensive simulations investigating the reliability of percentage of variance explained thresholds.
result Conventional threshold methods may fail to accurately explain overall variance in multivariate functional data.

Binary hashing is a well-known approach for fast approximate nearest-neighbor search in information retrieval. Much work has focused on affinity-based objective functions involving the hash functions or binary codes. These objective functions encode neighborhood information between data points and are often inspired by…

2016-02-04abs ↗pdf ↗

Unified approach for nonparametric regression and conditional distribution learning.

problem Nonparametric regression and conditional distribution learning problems.
method Generative learning framework with deep neural networks to estimate a conditional generator.
result The approach estimates a regression function and a conditional generator simultaneously, providing good prediction intervals.

New approach to bilevel optimization for machine learning using functional methods.

problem Solving bilevel optimization problems in machine learning, especially with over-parameterized neural networks.
method Functional point of view, scalable and efficient algorithms for functional bilevel optimization.
result Demonstrates benefits of functional approach on instrumental regression and reinforcement learning tasks.

Efficient binary sampling method for global optimization of univariate functions with low regret.

problem Global optimization of univariate loss functions.
method Binary sampling approach to circumvent hard-to-determine query points in traditional methods.
result At most Llog(3T)L\log (3T) and 2.25H2.25H regret for LL-Lipschitz continuous and HH-Lipschitz smooth functions respectively.

Unified approach for predicting missing segments in partially observed functions.

problem Predicting missing segments in partially observed functions with complex dependence and irregular noise.
method Unified registration and prediction approach under the conformal prediction framework, integrating amplitude and phase components.
result Effective prediction bands with finite-sample marginal coverage guarantees under weak assumptions.

New GP model estimates piecewise continuous functions.

problem Piecewise continuous regression functions in scientific and engineering applications.
method Local Gaussian process model with partitioned local data and joint estimation of boundaries.
result Superior performance over conventional GP models in estimating piecewise regression functions.

The paper explores how prior functions and bootstrapping improve ensemble uncertainty estimation.

problem Improving uncertainty estimation in machine learning models.
method Investigates the benefits of prior functions and bootstrapping in ensemble models.
result Prior functions and bootstrapping enhance ensemble agents' uncertainty estimation across different inputs.

The Heston model is a popular stock price model with stochastic volatility that has found numerous applications in practice. In the present paper, we study the Riemannian distance function associated with the Heston model and obtain explicit formulas for this function using geometrical and analytical methods. Geometric…

2013-02-10abs ↗pdf ↗

We propose a novel Bayesian Optimization approach for black-box functions with an environmental variable whose value determines the tradeoff between evaluation cost and the fidelity of the evaluations. Further, we use a novel approach to sampling support points, allowing faster construction of the acquisition function.…

2017-03-13abs ↗pdf ↗

Bayesian approach approximates probability functions of Gaussian mixtures.

problem Approximating probability functions of non-spherical Gaussian mixtures.
method Bayesian decomposition, spherical radial decomposition, random sampling.
result Established differentiability and integral representation of gradient for probability functions.