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

2595177761,034 · Jun 202019922001200920172026
48 results for Unwanted Results

LLE produces unwanted results without regularization, which can be prevented with regularization.

problem LLE's inherent unwanted results without regularization.
method Mathematical proof and numerical examples of regularization effectiveness.
result Regularization prevents unwanted results in LLE.

We propose a novel approach to achieving invariance for deep neural networks in the form of inducing amnesia to unwanted factors of data through a new adversarial forgetting mechanism. We show that the forgetting mechanism serves as an information-bottleneck, which is manipulated by the adversarial training to learn in…

2019-11-11abs ↗pdf ↗

A statistical framework for removing unwanted data domains in machine learning.

problem Removing unwanted data domains in machine learning while preserving desired performance.
method Modeling domains as probability distributions and using hypothesis testing to select samples to remove.
result Characterization of allowable edited data distributions and removal-preservation Pareto frontiers for various distribution families.

Selective removal of data subsets can efficiently unlearn unwanted distributions.

problem Efficiently removing unwanted data subsets without losing important information.
method Formalized as distributional unlearning, using Kullback-Leibler divergence constraints to select a small subset of data.
result Proposed method achieves corresponding log-loss bounds and is quadratically more sample-efficient than random removal.

This article studies the financial time series data processing for machine learning. It introduces the most frequent scaling methods, then compares the resulting stationarity and preservation of useful information for trend forecasting. It proposes an empirical test based on the capability to learn simple data relation…

2019-07-03abs ↗pdf ↗

New method removes unwanted information from representations efficiently.

problem Learning representations that are uninformative about a target variable.
method Adversarial training with a novel proxy metric for mutual information, leading to an analytically computable approximation.
result Our method effectively removes unwanted information with limited time budget.

In deep reinforcement learning (RL), adversarial attacks can trick an agent into unwanted states and disrupt training. We propose a system called Robust Student-DQN (RS-DQN), which permits online robustness training alongside Q networks, while preserving competitive performance. We show that RS-DQN can be combined with…

2019-11-03abs ↗pdf ↗

Solving tasks in Reinforcement Learning is no easy feat. As the goal of the agent is to maximize the accumulated reward, it often learns to exploit loopholes and misspecifications in the reward signal resulting in unwanted behavior. While constraints may solve this issue, there is no closed form solution for general co…

2018-05-28abs ↗pdf ↗

Estimation in generalized linear models (GLM) is complicated by the presence of constraints. One can handle constraints by maximizing a penalized log-likelihood. Penalties such as the lasso are effective in high dimensions, but often lead to unwanted shrinkage. This paper explores instead penalizing the squared distanc…

2017-11-03abs ↗pdf ↗

Paper develops a neural-fuzzy controller for GPS-intelligent buoys.

problem Optimally track dynamically positioned marine buoys with unknown parameters.
method Dynamic system modeling using neural-fuzzy networks with backstepping technique.
result The controller minimizes position errors and adjusts buoy positions accurately.

We use the P&L on a particular class of swaps, representing variance and higher moments for log returns, as estimators in our empirical study on the S&P500 that investigates the factors determining variance and higher-moment risk premia. This class is the discretisation invariant sub-class of swaps with Neuberger's agg…

2016-02-02abs ↗pdf ↗

Generative adversarial networks fix aliasing issues by making signals continuous.

problem Alias-free generation in GANs to prevent unwanted information leakage.
method Interpreting all signals as continuous, deriving small architectural changes.
result Generative models match FID of StyleGAN2 but have better internal representations.

We investigate the problem of learning representations that are invariant to certain nuisance or sensitive factors of variation in the data while retaining as much of the remaining information as possible. Our model is based on a variational autoencoding architecture with priors that encourage independence between sens…

2015-11-03abs ↗pdf ↗

The paper detects and identifies bias in data using a counterfactual approach.

problem Detecting and identifying bias in data, especially in medical image classification.
method A global explanation framework using the counterfactual approach to identify bias causing artifacts.
result Black frames significantly influence Convolutional Neural Network's prediction, changing benign to malignant.

Computer generated academic papers have been used to expose a lack of thorough human review at several computer science conferences. We assess the problem of classifying such documents. After identifying and evaluating several quantifiable features of academic papers, we apply methods from machine learning to build a b…

2010-08-04abs ↗pdf ↗

Extends Demographic Parity for fairer wage predictions with expert knowledge.

problem Inadequate fairness metrics limit user domain knowledge and ignore intersectional fairness.
method Develops a parametric method to incorporate expert knowledge in fair predictions.
result Offers a robust solution for real-life applications with limited data and spending constraints.

"Overlearning" means that a model trained for a seemingly simple objective implicitly learns to recognize attributes and concepts that are (1) not part of the learning objective, and (2) sensitive from a privacy or bias perspective. For example, a binary gender classifier of facial images also learns to recognize races…

2019-05-28abs ↗pdf ↗

Commonly used in computer vision and other applications, robust PCA represents an algorithmic attempt to reduce the sensitivity of classical PCA to outliers. The basic idea is to learn a decomposition of some data matrix of interest into low rank and sparse components, the latter representing unwanted outliers. Althoug…

2015-12-07abs ↗pdf ↗

A new RL framework handles autocorrelated actions for better learning and stability.

problem Improving reinforcement learning algorithms for better stability and efficiency.
method Introduces a new algorithm that optimizes policies with autocorrelated actions.
result The new algorithm outperforms existing methods in four simulated control problems.

Quantile normalisation is a popular normalisation method for data subject to unwanted variations such as images, speech, or genomic data. It applies a monotonic transformation to the feature values of each sample to ensure that after normalisation, they follow the same target distribution for each sample. Choosing a "g…

2017-06-01abs ↗pdf ↗

This paper addresses the mode collapse for generative adversarial networks (GANs). We view modes as a geometric structure of data distribution in a metric space. Under this geometric lens, we embed subsamples of the dataset from an arbitrary metric space into the l2 space, while preserving their pairwise distance distr…

2018-05-19abs ↗pdf ↗

Machine learning algorithms are optimized to model statistical properties of the training data. If the input data reflects stereotypes and biases of the broader society, then the output of the learning algorithm also captures these stereotypes. In this paper, we initiate the study of gender stereotypes in {\em word emb…

2016-06-20abs ↗pdf ↗

Recent advances in Representation Learning and Adversarial Training seem to succeed in removing unwanted features from the learned representation. We show that demographic information of authors is encoded in -- and can be recovered from -- the intermediate representations learned by text-based neural classifiers. The …

2018-08-20abs ↗pdf ↗

Study shows increased VRE penetration reduces electricity prices and volatility.

problem Impact of increased variable renewable energy on electricity prices and volatility.
method Hourly, real-time data from six ISOs, quantile and skew t-distribution regressions.
result Increased VRE penetration is associated with decreased system electricity price and volatility in most ISOs.

New method reduces bias in NLI models using ensemble adversarial training.

problem Spurious correlations between hypotheses and entailment classes in NLI datasets.
method Adversarial training with an ensemble of classifiers to reduce bias in sentence representations.
result Ensemble adversarial training produces more robust NLI models, outperforming previous methods.

RB-Modulation trains free diffusion models without external adapters.

problem Training-free personalization of diffusion models with style and content control.
method Stochastic optimal control with a style descriptor and cross-attention aggregation.
result Precise content and style extraction and control without external adapters.

Researchers validate ML scenario generators by checking dependencies and detecting memorization effects.

problem Validation of machine learning-based scenario generators differs from classical methods due to data-driven dependencies.
method Two novel validation aspects: checking dependencies and detecting memorization effects. Novel memorization ratio introduced.
result Validation methods successfully detect dependencies and memorization effects in ML-based scenario generators.

Prevents sensitive data generation in diffusion models using labeled and unlabeled data.

problem Generating sensitive data in diffusion models using unlabeled data.
method Positive-Unlabeled Diffusion Models, approximating ELBO with labeled and unlabeled data.
result Prevents the generation of sensitive data without compromising image quality.