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

Trend · papers per month

111221332442 · Jun 202019922001200920172026
48 results for feature responsiveness

The paper provides risk bounds for learning many response functions using linear regression.

problem Learning many response functions from a single dataset.
method Ordinary least squares regression in a high-dimensional feature space.
result Convergence guarantees on worst-case excess prediction risk for infinite response functions with finite VC dimension.

Proposes a new method to explain model predictions for consumer recourse.

problem Current explanation methods fail to provide meaningful recourse to decision subjects.
method Develops feature responsiveness scores to highlight actionable features.
result Standard practices can undermine decision subjects by highlighting unresponsive features.

We simplify complex regression coefficients using linearization and feature comparison.

problem Interpreting high-dimensional regression coefficients from nonlinear responses.
method Developed a linearization method to derive feature coefficients and compare them with regression coefficients.
result Shows how regression coefficients relate to linearized feature coefficients and how they change under regularization.

Nonparametric estimation of the conditional distribution of a response given high-dimensional features is a challenging problem. It is important to allow not only the mean but also the variance and shape of the response density to change flexibly with features, which are massive-dimensional. We propose a multiscale dic…

2013-12-04abs ↗pdf ↗

Proposes φφ-table for statistical SHAP explanations in regression models.

problem Lack of clear directional summaries, uncertainty, and fidelity in SHAP feature importance.
method SHAP importance selection, fitting a standardized linear surrogate, reporting coefficients, uncertainty, fidelity, and stability.
result Extends SHAP into a statistical global explanation with direction, uncertainty, fidelity, and stability.

The vast majority of current machine learning algorithms are designed to predict single responses or a vector of responses, yet many types of response are more naturally organized as matrices or higher-order tensor objects where characteristics are shared across modes. We present a new machine learning algorithm BaTFLE…

2016-12-09abs ↗pdf ↗

The study uses response theory to understand RNNs processing input signals.

problem Understanding how RNNs process sequential data.
method Deriving a Volterra series representation for SRNNs output using response theory from nonequilibrium statistical mechanics.
result SRNNs can be viewed as kernel machines operating on a reproducing kernel Hilbert space associated with the response feature.

Novel Bayesian model improves EEG-based BCI character selection.

problem Accurately identifying target-related responses in EEG-based BCIs.
method Probit-link Split-and-merge Gaussian Process (P-SMGP) prior for feature selection.
result Reduces computational complexity and provides interpretable statistical interpretations.

Here, we present a novel approach to solve the problem of reconstructing perceived stimuli from brain responses by combining probabilistic inference with deep learning. Our approach first inverts the linear transformation from latent features to brain responses with maximum a posteriori estimation and then inverts the …

2017-05-19abs ↗pdf ↗

DFR models dynamic distributional data with weighted Fréchet means.

problem Regression of distribution-valued responses over time.
method Dynamic Fréchet Regression (DFR) with index-aware weighting and feature selection.
result Improved predictive accuracy and feature recovery over existing methods.

New measure of feature influence in classification problems considering feature dependencies.

problem Measuring the influence of features in classification problems with dependencies.
method Developed a new measure based on cooperative game theory, providing axiomatic characterization and demonstrating its equivalence to the Banzhaf-Owen value.
result The proposed influence measure effectively characterizes feature importance in classification problems with feature dependencies.

This thesis responds to the challenges of using a large number, such as thousands, of features in regression and classification problems. There are two situations where such high dimensional features arise. One is when high dimensional measurements are available, for example, gene expression data produced by microarray…

2007-09-18abs ↗pdf ↗

New algorithm extracts features from superpositions in machine learning models.

problem Challenges in extracting interpretable features from complex models in superposition.
method An efficient query algorithm that identifies non-degenerate feature directions and reconstructs the function.
result Identifies all feature directions whose responses are non-degenerate and reconstructs the function \( f \) in a general superposition setting.

Improves dialogue response model interpretability using attention and regularization.

problem Improving interpretability of dual encoder models for dialogue response suggestions.
method Integrates attention mechanism and novel regularization loss to emphasize important words.
result Improves model accuracy and interpretability compared to existing methods.

Traditional set prediction models can struggle with simple datasets due to an issue we call the responsibility problem. We introduce a pooling method for sets of feature vectors based on sorting features across elements of the set. This can be used to construct a permutation-equivariant auto-encoder that avoids this re…

2019-06-06abs ↗pdf ↗

User response prediction makes a crucial contribution to the rapid development of online advertising system and recommendation system. The importance of learning feature interactions has been emphasized by many works. Many deep models are proposed to automatically learn high-order feature interactions. Since most featu…

2019-04-02abs ↗pdf ↗

The inputs of deep neural network (DNN) from real-world data usually come with uncertainties. Yet, it is challenging to propagate the uncertainty in the input features to the DNN predictions at a low computational cost. This work employs a gradient-based subspace method and response surface technique to accelerate the …

2019-03-10abs ↗pdf ↗

We consider the problem of classifying business process instances based on structural features derived from event logs. The main motivation is to provide machine learning based techniques with quick response times for interactive computer assisted root cause analysis. In particular, we create structural features from p…

2017-10-08abs ↗pdf ↗

FCOC framework improves financial volatility forecasting.

problem Tackles dual challenges of feature fidelity and model responsiveness in financial volatility forecasting.
method Synergizes fractal feature extraction and dynamic chaotic oscillation processing.
result Demonstrates profound and generalizable impact on S\&P 500 and DJI datasets.

Deep neural networks (DNNs) achieve state-of-the-art results in a variety of domains. Unfortunately, DNNs are notorious for their non-interpretability, and thus limit their applicability in hypothesis-driven domains such as biology and healthcare. Moreover, in the resource-constraint setting, it is critical to design t…

2017-12-22abs ↗pdf ↗

PSMM method optimizes matrix sufficient dimension reduction.

problem Feature matrices with row- and column-wise interpretations require efficient dimension reduction.
method PSMM method converts matrix problem into classification problems using rank-1 normal matrix.
result PSMM outperforms existing methods and provides strong interpretability.

New algorithms achieve decision calibration without sample complexity dependent on feature dimension.

problem Achieving decision calibration for nonlinear loss functions with polynomial sample complexity.
method Developed smooth relaxation of decision calibration, enabling dimension-free algorithms.
result Efficient algorithms post-process predictors to satisfy decision calibration without worsening accuracy.

Collaborative Trees model analyzes feature interactions and additive effects.

problem Analyzing complex statistical associations between features and response variables.
method Proposes a novel tree model and its bagging version to decompose mean decrease in impurity and visualize feature contributions.
result Demonstrates the superior capability of the tree model in estimating additive effects and interaction effects.

ERAPS builds prediction sets for time-series data.

problem Uncertainty quantification in complex machine learning methods for time-series data.
method ERAPS is an ensemble-based framework for constructing prediction sets for time-series data, allowing unknown dependencies within features and responses.
result ERAPS demonstrates valid marginal and conditional coverage and yields smaller prediction sets than competing methods.

Proposes methods to correct bias and missing data in regression models.

problem Nonignorable selection bias and missing response in regression models.
method Imputation-based and importance weighted regression methods, including repeated regression and doubly robust combination.
result Repeated regression can effectively correct bias and outperforms weighted regression in extrapolation.

Combines RFs and GLMs for better accuracy and interpretable feature importance.

problem Inability to interpret random forests (RFs) due to black box nature and unstable feature importance methods.
method Reinterprets decision trees and MDI as linear regression and R² values, combining RFs and GLMs in RF+.
result MDI+ outperforms existing feature importance measures in identifying signal features and stability.

The study optimizes sampling in complex systems with probabilistic response distributions.

problem Calibrating and optimizing complex systems with probabilistic response distributions.
method Non-parametric Bayesian approach to modeling spatial fields of probability distributions, introducing adaptive sampling strategies.
result Adaptive sampling strategies improve system evaluations by guiding focus towards key features.