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

Trend · papers per month

117234351468 · Jun 202019922001200920172026
48 results for feature sharing

A framework isolates and learns approximately shared features for better domain adaptation.

problem Reducing performance degradation in unseen domains using machine learning models.
method Statistical framework distinguishing feature utilities based on correlation variance across domains. Learning approximately shared features from source tasks and fine-tuning on target tasks.
result Improved population risk compared to previous results on both source and target tasks, resolving the paradox of feature selection.

PerPCA separates unique and shared features from heterogeneous data.

problem Extracting shared and unique features from data collected from different sources with varying trends.
method Personalized PCA (PerPCA) uses orthogonal global and local principal components to encode both unique and shared features.
result PerPCA can identify and recover both unique and shared features under mild conditions.

We propose Deep Asymmetric Multitask Feature Learning (Deep-AMTFL) which can learn deep representations shared across multiple tasks while effectively preventing negative transfer that may happen in the feature sharing process. Specifically, we introduce an asymmetric autoencoder term that allows reliable predictors fo…

2017-08-01abs ↗pdf ↗

Multiclass prediction is the problem of classifying an object into a relevant target class. We consider the problem of learning a multiclass predictor that uses only few features, and in particular, the number of used features should increase sub-linearly with the number of possible classes. This implies that features …

2011-09-05abs ↗pdf ↗

Distributed machine learning has been widely studied in order to handle exploding amount of data. In this paper, we study an important yet less visited distributed learning problem where features are inherently distributed or vertically partitioned among multiple parties, and sharing of raw data or model parameters amo…

2019-07-17abs ↗pdf ↗

Improved neural population modeling using shared features and ensemble detection.

problem Missing shared coding properties in neural latent variable models.
method Feature sharing across tuning curves and soft clustering of neurons.
result More interpretable and better-performing neural population models.

Study predicts customer data sharing in Open Banking and explains key factors.

problem Predicting and explaining customer data sharing in Open Banking environments.
method Hybrid data balancing strategy with ADASYN and NEARMISS, XGBoost models, SHAP, CART.
result 91.39% accuracy for inflow and 91.53% for outflow predictions, revealing influential features.

Contrastive learning properties studied, including feature suppression and hierarchical learning.

problem Feature suppression and hierarchical learning in contrastive learning.
method Generalized contrastive loss, instance-based contrastive learning, explicit and controllable competing features.
result Contrastive learning can suppress and prevent the learning of competing features.

Improved supervised EM learning for shared kernel models with feature space partitioning.

problem Lack of rigour in EM derivation and high computational complexity.
method Detailed derivation of EM for Gaussian shared kernel model, feature space partitioning to reduce complexity.
result Improved performance at reduced complexity achieved.

MT-HAL learns features and task associations for multiple tasks with a shared sparse structure.

problem Learning features and task associations for multiple tasks with shared structure.
method Fully nonparametric approach that learns features, samples, and task associations with a shared sparse structure.
result MT-HAL achieves a powerful convergence rate and outperforms other methods across various simulation settings.

New algorithms minimize regret in multi-task and lifelong linear bandits with shared representation.

problem Minimizing regret in multi-task and lifelong linear bandits with shared representation.
method Novel algorithms using efficient estimator for low-rank linear feature extractor and novel analysis.
result Achieved regret bounds matching minimax lower bound up to logarithmic factors.

Deep RL policies share adversarial features across different MDPs.

problem Understanding decision boundaries and loss landscapes in neural policies.
method Investigating similarities in high sensitivity directions across MDPs using Arcade Learning Environment.
result High sensitivity directions for neural policies are correlated across MDPs, suggesting shared non-robust features.

Hybrid model combines PCA and RNN for better aerospace stock price prediction.

problem Challenges in predicting stock prices of aerospace companies due to market uncertainty and complexity.
method Combination of Principal Component Analysis (PCA) and Recurrent Neural Networks (RNN).
result PCA improves both accuracy and efficiency of stock price prediction.

Bayesian interpretations of neural network have a long history, dating back to early work in the 1990's and have recently regained attention because of their desirable properties like uncertainty estimation, model robustness and regularisation. We want to discuss here the application of Bayesian models to knowledge sha…

2019-12-02abs ↗pdf ↗

Paper proposes MMVFL for multi-class VFL with multiple participants.

problem Privacy-preserving multi-class VFL with multiple participants.
method Extends multi-view learning to enable label sharing among multiple VFL participants.
result MMVFL effectively shares label information among multiple VFL participants and matches multi-class classification performance.

Latent feature models are widely used to decompose data into a small number of components. Bayesian nonparametric variants of these models, which use the Indian buffet process (IBP) as a prior over latent features, allow the number of features to be determined from the data. We present a generalization of the IBP, the …

2011-10-25abs ↗pdf ↗

New model allocates features sublinearly, improving model fit and performance.

problem Linear growth of shared features limits model flexibility and performance.
method Developed non-exchangeable feature allocation models with sublinear feature sharing.
result Sublinear feature sharing leads to better model fit and predictive performance.

Paper tackles robust decision-making from multiple sites with shared structure.

problem Learning robust sequential decisions from heterogeneous multi-site datasets.
method Group-Robust MDPs with d-rectangular uncertainty sets, feature-wise worst-case aggregation, and cluster-level pooling.
result Proves suboptimality bound for robust planning policy under robust partial coverage assumption.

DeepSeekMoE improves language model efficiency with shared experts and normalized gating.

problem Improving sample efficiency in language model architectures.
method Theoretical and empirical analysis of shared experts and normalized sigmoid gating.
result Theoretical and empirical evidence of improved sample efficiency with shared experts and normalized gating.

PIMA autoencoders discover shared features in multimodal scientific data.

problem Discovering shared information in high-throughput scientific datasets.
method Physics-informed multimodal autoencoders (PIMA) with Gaussian mixture prior and product of experts formulation.
result Accurate cross-modal inference between images and mechanical stress-strain response in lattice metamaterials.

Quaternion self-attention reduces computational cost and improves performance.

problem Existing quaternion self-attention increases computational cost and diverges attention distributions.
method Proposes a shared-score quaternion self-attention mechanism.
result Reduces score-computation multiplications by 75% and softmax operations from four to one.

Proposes TFCL to mitigate negative transfer in MTL by collaborating across features and tasks.

problem Negative transfer in Multi-Task Learning (MTL) due to dissimilar tasks.
method Task-Feature Collaborative Learning (TFCL) with heterogeneous block-diagonal structure regularizer and optimization method.
result Global convergence and block-diagonal structure recovery guarantees.

PPG separates policy and value function training phases for better reinforcement learning efficiency.

problem Challenges in traditional reinforcement learning methods for policy and value function optimization.
method Integrates Phasic Policy Gradient framework that splits policy and value function training into distinct phases.
result Significantly improves sample efficiency on Procgen Benchmark compared to PPO.

Paper improves bike-sharing demand prediction by adapting to changing patterns.

problem Improving bike-sharing demand prediction under temporal domain shifts.
method Gen-ROTDA, a robust optimal transport-guided residual domain adaptation framework.
result Gen-ROTDA achieves the lowest MAE and is the best OT-family method on average.

New model captures complex relationships from experimental data.

problem Capturing intricate feature interactions in empirical data.
method Shape Arithmetic Expressions (SHAREs) combining GAMs and mathematical expressions.
result SHAREs model captures complex feature interactions.

Model predicts stock prices using Twitter sentiment data.

problem Predicting stock prices using social media sentiment.
method Extracted 19 sentiment features from Twitter posts about Petrobras, trained XBoot models, and simulated trading.
result Simulated trading gained R$88,82 (net) over 250 days.

New method identifies shared components from unpaired multimodal mixtures.

problem Identify shared components from unpaired multimodal mixtures.
method Distribution divergence minimization-based loss with sufficient conditions for identifiability.
result Sufficient conditions for shared component identifiability from unaligned multimodal mixtures.

The paper addresses risk sharing and variability measures among agents with general risk preferences.

problem Risk sharing and variability measures among agents with general risk preferences.
method Characterizes Pareto-optimal allocations using Gini deviation, mean-median deviation, and inter-quantile difference as variability measures.
result Optimal allocations are not comonotonic and feature a mixture of pairwise counter-monotonic structures.

Recommender systems (RS), which have been an essential part in a wide range of applications, can be formulated as a matrix completion (MC) problem. To boost the performance of MC, matrix completion with side information, called inductive matrix completion (IMC), was further proposed. In real applications, the factorize…

2019-05-27abs ↗pdf ↗

A limaçon-like curve, allowing 2π-transition with monotone curvature between concentric curvature elements, is presented. The curve is 4th degree algebraic, 4th degree rational, and shares other common features with Pascal's limaçon.

2013-09-22abs ↗pdf ↗

A novel approach tackles sparse linear bandits with reduced communication costs and minimal cumulative regret.

problem Sparse linear bandits with high-dimensional feature vectors and limited relevant features.
method Cooperative Thresholded Lasso using Lasso and ridge regression for dimension reduction and aggregation.
result Regret bound of O(s0logd+s0T)\mathcal{O}(s_0 \log d + s_0 \sqrt{T}) with high probability.