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

Trend · papers per month

213425638850 · Jun 202019922001200920172026
48 results for subspace-based approach

New method reduces high-dimensional data to key features.

problem Challenges of high-dimensional data analysis and interpretability.
method Randomized search to produce subspaces, ensemble of models for variable selection.
result Outperforms existing methods in prediction and variable selection.

ProSub uses angles in feature space to classify data as in- or out-of-distribution.

problem Open-set semi-supervised learning with unknown classes.
method Probabilistic approach based on angles in feature space, estimating conditional distributions of scores.
result ProSub achieves state-of-the-art performance on benchmark problems.

Deep ensembles have been empirically shown to be a promising approach for improving accuracy, uncertainty and out-of-distribution robustness of deep learning models. While deep ensembles were theoretically motivated by the bootstrap, non-bootstrap ensembles trained with just random initialization also perform well in p…

2019-12-05abs ↗pdf ↗

In this work, we propose a subspace-based algorithm for DOA estimation which iteratively reduces the disturbance factors of the estimated data covariance matrix and incorporates prior knowledge which is gradually obtained on line. An analysis of the MSE of the reshaped data covariance matrix is carried out along with c…

2018-05-01abs ↗pdf ↗

Error-robust multi-view clustering tackles noisy data across multiple sources.

problem Error in multi-view data degrades clustering performance.
method Blind clustering without error consideration is ineffective. Various approaches like sparsity, graph, subspace, and deep learning are reviewed.
result Error-robust multi-view clustering improves clustering accuracy even with corrupted data.

Rare data in a large-scale database are called outliers that reveal significant information in the real world. The subspace-based outlier detection is regarded as a feasible approach in very high dimensional space. However, the outliers found in subspaces are only part of the true outliers in high dimensional space, in…

2014-05-05abs ↗pdf ↗

Text classification has become indispensable due to the rapid increase of text in digital form. Over the past three decades, efforts have been made to approach this task using various learning algorithms and statistical models based on bag-of-words (BOW) features. Despite its simple implementation, BOW features lack se…

2018-06-08abs ↗pdf ↗

A new method tackles bilevel optimization using Lanczos process for efficient hyper-gradient computation.

problem Efficiently solving large-scale bilevel optimization problems with gradient-based methods.
method Constructing low-dimensional approximate Krylov subspaces with the Lanczos process to approximate the Hessian inverse vector product.
result Demonstrates a O(ε1)\mathcal{O}(ε^{-1}) convergence rate and efficiency in synthetic and deep learning tasks.

New Krylov subspace methods speed up mixed-effects models with crossed random effects.

problem Slow computations for high-dimensional crossed random effects in mixed-effects models.
method Krylov subspace-based methods for generalized mixed-effects models with cross effects.
result Speedups by factors of up to 10,000 in computations for mixed-effects models.

Physics-based framework improves building energy forecasting.

problem Lack of physical correspondence in machine learning models for building energy systems.
method Combines LTI SSMs with subspace-based domain adaptation (SDA).
result Physics-derived subspaces align with data-derived subspaces for better forecasting.

LOFT separates subspace rotation and transformation for orthogonal fine-tuning.

problem Conflating subspace rotation and transformation in orthogonal fine-tuning.
method LOFT explicitly separates subspace rotation and transformation, using task-aware support selection.
result LOFT recovers principal-subspace orthogonal adaptation and improves efficiency-performance trade-off.

Unified multi-view learning framework using OPLS with regularization and deep extensions.

problem Improving multi-view learning for classification and feature extraction.
method Orthonormalized Partial Least Squares (OPLS) with regularization and deep extensions.
result Unified multi-view learning framework with improved performance.

The main goal of this paper is to study the geometric structures associated with the representation of tensors in subspace based formats. To do this we use a property of the so-called minimal subspaces which allows us to describe the tensor representation by means of a rooted tree. By using the tree structure and the d…

2015-05-12abs ↗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.

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 ↗