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

1122 · Jul 202019922001200920172026
37 results for Feature-Specific

BCDP enhances privacy by protecting sensitive features more precisely.

problem Uniform privacy protection in LDP degrades performance for sensitive features.
method Bayesian Coordinate Differential Privacy (BCDP) adjusts privacy protection per feature sensitivity.
result BCDP improves accuracy in downstream tasks without sacrificing privacy.

Deep semi-supervised learning identifies tree species from natural images.

problem Identifying tree species in natural settings with limited labeled data.
method Two-fold approach using deep semi-supervised learning.
result Achieves 94.04% top-5 accuracy for leaves and 83.04% for bark.

Memory-Augmented Meta-Optimization improves cold-start recommendation.

problem Cold-start problem in recommender systems for new users or items.
method Memory-Augmented Meta-Optimization approach with personalized and task-specific memories.
result Significant improvement in cold-start recommendation performance on multiple datasets.

A new metric evaluates generative models by comparing real and generated samples.

problem Evaluating the quality of generative models.
method Relative Density Ratio (RDR) function, optimization on variational form of φ-divergence.
result The RDR function provides a clear, interpretable, and numerically stable evaluation metric.

New method improves feature selection in tree-based models.

problem Previous feature selection methods in tree-based models lack sufficient regularization and sub-optimal performance.
method Developed a new gain penalization approach for tree-based models that allows for flexible feature-specific importance weights.
result The new method improves out-of-sample performance, especially with correlated features.

Q-SHAP efficiently calculates feature contributions in boosting trees.

problem Global evaluation of feature contributions in tree models.
method Q-SHAP, an efficient algorithm that reduces Shapley values calculation to polynomial time.
result Q-SHAP improves computational efficiency and enhances accuracy of feature-specific R2R^2 estimates.

Given the apparent difficulty of learning models that are robust to adversarial perturbations, we propose tackling the simpler problem of developing adversarially robust features. Specifically, given a dataset and metric of interest, the goal is to return a function (or multiple functions) that 1) is robust to adversar…

2018-11-15abs ↗pdf ↗

Mixture models are powerful statistical models used in many applications ranging from density estimation to clustering and classification. When dealing with mixture models, there are many issues that the experimenter should be aware of and needs to solve. The MixEst toolbox is a powerful and user-friendly package for M…

2015-07-22abs ↗pdf ↗

Study optimal liquidation strategies on Uniswap v2/v3 considering price impact.

problem Optimal liquidation of large positions on Uniswap v2/v3 under transient price impact.
method Dynamic programming and numerical approximation for Uniswap v3, closed-form solutions for v2.
result Obtained optimal strategies for both Uniswap v2 and v3, showing how liquidity profile influences them.

Multi-task learning is a type of transfer learning that trains multiple tasks simultaneously and leverages the shared information between related tasks to improve the generalization performance. However, missing features in the input matrix is a much more difficult problem which needs to be carefully addressed. Removin…

2018-07-06abs ↗pdf ↗

Traditionally, multitask learning (MTL) assumes that all the tasks are related. This can lead to negative transfer when tasks are indeed incoherent. Recently, a number of approaches have been proposed that alleviate this problem by discovering the underlying task clusters or relationships. However, they are limited to …

2012-06-18abs ↗pdf ↗

Deep neural networks solve stochastic control problems with delay.

problem Challenges in stochastic control problems with delay due to path-dependence and high dimensions.
method Employing recurrent neural networks (RNNs) to parameterize policies and optimize objectives.
result RNNs, especially LSTMs, efficiently capture path-dependence and outperform feedforward networks in training and performance.

New insights into how overfitting affects neural networks' performance.

problem Understanding the generalization of overfitted two-layer neural networks.
method Analyzing the NTK model with ReLU activation, focusing on min 2\ell_2-norm solutions.
result Generalization error of overfitted NTK models approaches a small limiting value, even with infinite neurons and samples.

New systemic risk models for banks choosing their group memberships.

problem Analyzing systemic risk for banks in disjoint and overlapping groups.
method Proposed new models with realistic game features, introducing Nash equilibrium for optimal solution.
result Explicit solution for risk allocation and existence/uniqueness of Nash equilibrium.

Encoding domain knowledge into the prior over the high-dimensional weight space of a neural network is challenging but essential in applications with limited data and weak signals. Two types of domain knowledge are commonly available in scientific applications: 1. feature sparsity (fraction of features deemed relevant)…

2020-02-24abs ↗pdf ↗

As datasets grow richer, an important challenge is to leverage the full features in the data to maximize the number of useful discoveries while controlling for false positives. We address this problem in the context of multiple hypotheses testing, where for each hypothesis, we observe a p-value along with a set of feat…

2017-11-03abs ↗pdf ↗

The Unlearning algorithm improves neural network performance in memory tasks.

problem Improving neural network performance in memory tasks.
method Simplified Unlearning algorithm, structured training data, and new regularization technique for Boltzmann Machines.
result The Unlearning rule outperforms traditional Boltzmann-Machine learning in learning hidden probability distributions.

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.

CLIP models robustness to spurious features is re-evaluated using a new dataset.

problem Existing robustness tests of CLIP models may not fully reflect their performance on spurious features.
method Crafted a new dataset (CounterAnimal) to reveal CLIP models' reliance on realistic spurious features.
result CLIP models are robust to spurious features learned from their training data, not ImageNet.

This paper tackles unpaired data in multi-view learning, proposing a new framework and models.

problem Handling unpaired data in multi-view learning, which is more common than paired data.
method Generalized uncorrelated multi-view subspace learning framework with successive alternating approximation (SAA) method.
result Proposed models perform competitively or better than baselines in multi-view feature extraction and multi-modality classification.

Paper uses BERT to assess P2P borrowers' credit risk from loan descriptions.

problem Information asymmetry in P2P lending due to lack of borrower data.
method Fine-tunes BERT on Lending Club dataset to generate risk scores from loan descriptions.
result BERT-generated risk scores improve XGBoost classifier's performance in loan granting.

Taking into account high-order interactions among covariates is valuable in many practical regression problems. This is, however, computationally challenging task because the number of high-order interaction features to be considered would be extremely large unless the number of covariates is sufficiently small. In thi…

2015-06-26abs ↗pdf ↗

Multiple hypothesis testing, a situation when we wish to consider many hypotheses, is a core problem in statistical inference that arises in almost every scientific field. In this setting, controlling the false discovery rate (FDR), which is the expected proportion of type I error, is an important challenge for making …

2019-02-07abs ↗pdf ↗

Proposes SSL framework for improving item recommendations in large-scale systems.

problem Sparse feedback data for long-tail items in recommender systems.
method Multi-task self-supervised learning framework with data augmentation.
result Significant improvements in model performance, especially on slices lacking supervision.

Proposes a feature transformation for spatio-temporal traffic models to improve performance and transferability.

problem Limited transferability of deep learning models for traffic flow prediction across different locations.
method Integrates Newell's traffic flow estimators to capture broader dynamics and incorporates spatial dependencies.
result Improves model performance in predicting traffic flows over different horizons.

This study analyzes bias in face generation models and proposes mitigation techniques.

problem Bias in face generation models that may misrepresent certain social groups.
method Three approaches: generators, attribute modifier, and post-processing bias mitigators.
result Generators suffer from bias across all social groups, while post-processing mitigators show different feature concentration.

Synthetic learning improves neonatal brain MRI segmentation robustness.

problem Challenges in neonatal brain MRI segmentation due to image contrast and anatomical variations.
method Synthetic learning model trained on few T2-weighted volumes, then enhanced with motion artifacts and over-segmentation.
result Synthetic learning robust to image contrast and improves segmentation of both T1- and T2-weighted images.