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

213425638850 · Jun 202019922001200920172026
48 results for Klein-Grifone approach

Study investigates Hashiguchi connection's uniqueness and existence in Finsler geometry.

problem Investigating the Hashiguchi connection's uniqueness and existence in Finsler geometry.
method Intrinsic Finsler geometry using Klein-Grifone approach (KG-approach). Calculations for torsion and curvature tensors, examination of properties, and comparison of four fundamental linear connections.
result Investigates the Hashiguchi connection's uniqueness and existence in Finsler geometry.

The Klein-Grifone approach to global Finsler geometry is adopted. The nullity distributions of the three curvature tensors of Cartan connection are investigated. Nullity distributions concerning certain relevant special Finsler spaces are considered. Concrete examples are given whenever the situation needs.

2012-10-31abs ↗pdf ↗

The aim of the present paper is to establish a global theory of conformal changes in Finsler geometry. Under this change, we obtain the relationships between the most important geometric objects associated to (M,L)(M,L) and the corresponding objects associated to (M,L~)(M,\tilde{L}), L~=eσ(x)L\widetilde{L}=e^{σ(x)} L being the Finsl…

2006-10-01abs ↗pdf ↗

Geometric approach combines asset returns and investor views for better portfolio optimization.

problem Optimizing portfolios with investor-specific views.
method Generalized Wasserstein barycenter (GWB) to integrate statistical asset returns and investor views.
result The geometric approach offers more flexibility and rewards for correct investor views.

Paper proposes an alternative method to price American options using HJM approach.

problem Price American options efficiently and accurately.
method Utilizes HJM technique to model term structure of volatility for equity markets.
result Proposes a new value function, stopping criteria, and stopping time for American options.

We study inference and learning based on a sparse coding model with `spike-and-slab' prior. As in standard sparse coding, the model used assumes independent latent sources that linearly combine to generate data points. However, instead of using a standard sparse prior such as a Laplace distribution, we study the applic…

2012-11-15abs ↗pdf ↗

We develop a semi-analytic approach to the valuation of auto-callable structures with accrual features subject to barrier conditions. Our approach is based on recent studies of multi-assed binaries, present in the literature. We extend these studies to the case of time-dependent parameters. We compare numerically the s…

2016-08-18abs ↗pdf ↗

Two ML approaches learn local volatility surfaces from option prices, with GP being arbitrage-free.

problem Interpolating European vanilla option prices to create a local volatility surface.
method Gaussian process regression and neural net with arbitrage penalties.
result GP approach is arbitrage-free and yields best out-of-sample calibration error.

This paper critiques the Standardized Measurement Approach (SMA) for operational risk and recommends maintaining Advanced Measurement Approach (AMA).

problem Weaknesses and failures of the Standardized Measurement Approach (SMA) in operational risk.
method Critical review and analysis of SMA and AMA approaches.
result SMA is unstable, insensitive to risk, and implicitly related to systemic risk in the banking sector.

Two approaches extend knowledge distillation to Gaussian Processes, showing relationships to existing methods.

problem Applying knowledge distillation to Gaussian Processes for regression and classification.
method Data-centric and distribution-centric approaches to extend distillation to GPR and GPC.
result Distribution-centric approach for GPC approximately corresponds to data duplication and scaling.

We discuss the relative merits of optimistic and randomized approaches to exploration in reinforcement learning. Optimistic approaches presented in the literature apply an optimistic boost to the value estimate at each state-action pair and select actions that are greedy with respect to the resulting optimistic value f…

2017-06-13abs ↗pdf ↗

Classical approaches for approximate inference depend on cleverly designed variational distributions and bounds. Modern approaches employ amortized variational inference, which uses a neural network to approximate any posterior without leveraging the structures of the generative models. In this paper, we propose Amorti…

2019-06-06abs ↗pdf ↗

Bayesian symbolic regression automates model discovery from data.

problem Learning closed-form mathematical models from data using heuristic methods.
method Probabilistic approach to symbolic regression, connecting to information theory and statistical physics.
result Probabilistic approach provides model plausibility and performance guarantees.

New approach interprets Nyström for kernel machines with geometric insight.

problem No comparative study over Nyström-based kernel machine approaches.
method Developed a new approach with geometric interpretation, showing equivalence to existing methods.
result Proposed approach offers insights into approximation errors and accuracy.

Common Representation Learning (CRL), wherein different descriptions (or views) of the data are embedded in a common subspace, is receiving a lot of attention recently. Two popular paradigms here are Canonical Correlation Analysis (CCA) based approaches and Autoencoder (AE) based approaches. CCA based approaches learn …

2015-04-27abs ↗pdf ↗

Paper evaluates CNN-based facial landmark detection methods.

problem Evaluate characteristics and performance of CNN-based facial landmark detection methods.
method Divided into regression and heatmap approaches, investigated using a hybrid loss function and discrimination network.
result Proposed model outperforms other models in all tested datasets.

This paper provides a comprehensive benchmark and taxonomy for certifiably robust DNN defenses.

problem Certifiably robust defenses against adversarial attacks for deep neural networks.
method Taxonomy and benchmark of certifiably robust approaches.
result First comprehensive benchmark of certifiably robust approaches on different datasets.

Study proposes a new approach for deep hedging using artificial market simulations.

problem Challenges in selecting the best model for underlying asset simulations in deep hedging.
method Proposes artificial market simulations to replicate financial market stylized facts.
result Achieves similar performance to traditional approaches without mathematical finance models.

Some of recent developments, including recent results, ideas, techniques, and approaches, in the study of degenerate partial differential equations are surveyed and analyzed. Several examples of nonlinear degenerate, even mixed, partial differential equations, are presented, which arise naturally in some longstanding, …

2010-05-15abs ↗pdf ↗

We compare several approaches to learn an Optimal Map, represented as a neural network, between probability distributions. The approaches fall into two categories: ``Heuristics'' and approaches with a more sound mathematical justification, motivated by the dual of the Kantorovitch problem. Among the algorithms we consi…

2019-08-04abs ↗pdf ↗

This paper examines how optimization methods affect the reliability of detecting inputs outside a model's training distribution.

problem The unreliability of deep neural networks on out-of-distribution inputs.
method Analysis of optimization methods' impact on OOD detection approaches.
result Optimization methods significantly influence the robustness of OOD detection approaches.

Deep Neural Networks have shown tremendous success in the area of object recognition, image classification and natural language processing. However, designing optimal Neural Network architectures that can learn and output arbitrary graphs is an ongoing research problem. The objective of this survey is to summarize and …

2019-06-07abs ↗pdf ↗

In this paper, we propose three approaches for the estimation of the Tucker decomposition of multi-way arrays (tensors) from partial observations. All approaches are formulated as convex minimization problems. Therefore, the minimum is guaranteed to be unique. The proposed approaches can automatically estimate the numb…

2010-10-05abs ↗pdf ↗

Optimal sample complexity analysis for plug-in approach in average-reward MDPs.

problem Learning optimal policies in average-reward MDPs with a generative model.
method Plug-in approach that constructs a model estimate and computes an optimal policy.
result Optimal sample complexities for the plug-in approach without prior knowledge of problem parameters.

We devise a one-shot approach to distributed sparse regression in the high-dimensional setting. The key idea is to average "debiased" or "desparsified" lasso estimators. We show the approach converges at the same rate as the lasso as long as the dataset is not split across too many machines. We also extend the approach…

2015-03-14abs ↗pdf ↗

Active learning is a machine learning approach for reducing the data labeling effort. Given a pool of unlabeled samples, it tries to select the most useful ones to label so that a model built from them can achieve the best possible performance. This paper focuses on pool-based sequential active learning for regression …

2018-05-12abs ↗pdf ↗

Study systemic risk measures and capital allocation rules, showing commonalities.

problem Systemic risk measures and capital allocation in financial systems.
method Developed a general framework to embed axiomatic and injective capital approaches, introduced Aumann-Shapley CAR.
result Aumann-Shapley CAR provides a universal method for capital allocation regardless of risk measurement.

New approach transfers rewards learned in one environment to reinforcement learning in a new environment.

problem Transfer of rewards learned using inverse reinforcement learning from one environment to a new, different environment.
method Formulate the problem as a joint system of Bellman equations, develop minimax estimators for the target soft-qq-function, solve the source and target system of equations jointly.
result The coupled approach removes the first-order influence of source Bellman residual error compared to the sequential approach.

This paper reviews and proposes a new approach for evaluating internal cluster validation indices.

problem Selecting the best-performing unsupervised classification algorithm without external information.
method Examines and proposes a new evaluation approach for internal validation indices.
result Suggests a new evaluation approach for internal validation indices.

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.

Researchers extend a groupoid approach to calculate Wodzicki residue and Kontsevich-Vishik trace.

problem Calculating Wodzicki residue and Kontsevich-Vishik trace for pseudo-differential operators of any order.
method Groupoid approach to pseudo-differential operators.
result Extension of van Erp and Yuncken's work to operators of any order.