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

185370554739 · Jun 202019922001200920172026
48 results for Shared attention distribution

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.

This work proposes a collaborative multi-head attention layer to reduce model size without sacrificing accuracy.

problem Over-parameterization in transformer models trained with large datasets.
method Proposes a collaborative multi-head attention layer that shares key/query projections.
result Reduction in model size by 4 for same accuracy and speed.

Reinforcement learning in multi-agent scenarios is important for real-world applications but presents challenges beyond those seen in single-agent settings. We present an actor-critic algorithm that trains decentralized policies in multi-agent settings, using centrally computed critics that share an attention mechanism…

2018-10-05abs ↗pdf ↗

Transformers learn to generalize unseen tasks by composing self-attention layers.

problem How Transformers generalize to unseen, out-of-distribution tasks.
method Examined synthetic examples and pretrained LLMs, focusing on induction heads and latent subspace.
result Transformers can learn hidden rules for unseen tasks by composing self-attention layers, achieving OOD generalization.

Introduces Causal Energy Minimization to understand Transformer layers.

problem Empirical parameterization of Transformer blocks remains largely unexplored.
method Causal Energy Minimization framework that recasts Transformer layers as optimization steps on conditional energy functions.
result Identifies design space for Transformer layers including weight sharing and energy-based interpretations.

SCHA-VAE generates novel data from limited examples using hierarchical context aggregation.

problem Generating data from a novel distribution with limited examples.
method Hierarchical context aggregation with attention-based point to set-level aggregation.
result Hierarchical approach better captures intrinsic variability in small data.

Proposes vMF distribution for skewed elliptical distributions.

problem Skewed distributions not adequately modeled by symmetric distributions.
method Introduces von-Mises-Fisher (vMF) distribution to represent skewed elliptical distributions.
result vMF distribution provides an explicit and simple probability representation of skewed elliptical distributions.

New method estimates treatment effects across different populations.

problem Estimating treatment effects across populations with changing distributions.
method SBRL-HAP framework combining balancing and independence regularizers with hierarchical attention.
result Significant improvement in HTE estimation across out-of-distribution populations.

We statistically investigate the distribution of share price and the distributions of three common financial indicators using data from approximately 8,000 companies publicly listed worldwide for the period 2004-2013. We find that the distribution of share price follows Zipf's law; that is, it can be approximated by a …

2017-02-01abs ↗pdf ↗

This paper investigates weight-sharing in NAS, revealing its impact and providing solutions.

problem Reducing the time and computational cost of training neural networks.
method Comprehensive experiments on weight-sharing in NAS, analyzing variance and interference.
result Properly reducing weight sharing can reduce variance and improve model performance.

Paper proposes deep learning model for dynamic stock repurchase forecasting.

problem Complex temporal dependencies in corporate financial conditions.
method Hybrid Temporal Convolutional Network (TCN) and Attention-based LSTM.
result Model significantly outperforms static baselines in stock repurchase forecasting.

Federated learning interprets temporal dynamics across clients with graph attention.

problem Interpreting temporal patterns across decentralized, heterogeneous systems with nonlinear dynamics.
method Graph Attention Network for learning state transition models over latent states communicated between clients.
result First interpretable characterization of cross-client temporal interdependencies in decentralized nonlinear systems.

GAttNHP predicts future events in temporal knowledge graphs by encoding long-range dependencies and handling mutual excitation.

problem Forecasting future events in temporal knowledge graphs due to long-range dependencies, mutual excitation, and heavy-tailed inter-arrival times.
method GAttNHP uses a self-attention encoder, semantic soft-grouping, and NCQ regression to address these issues.
result GAttNHP improves entity and time prediction on six benchmark TKG datasets compared to state-of-the-art baselines.

In a Markovian stochastic volatility model, we consider financial agents whose investment criteria are modelled by forward exponential performance processes. The problem of contingent claim indifference valuation is first addressed and a number of properties are proved and discussed. Special attention is given to the c…

2011-09-18abs ↗pdf ↗

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 ↗

Time series prediction with deep learning methods, especially long short-term memory neural networks (LSTMs), have scored significant achievements in recent years. Despite the fact that the LSTMs can help to capture long-term dependencies, its ability to pay different degree of attention on sub-window feature within mu…

2018-11-09abs ↗pdf ↗

This paper proposes a new D2D data sharing approach to improve distributed machine learning training speed.

problem Straggler dilemma in distributed edge learning.
method Proposes a D2D data sharing approach to balance computation loads and optimize radio resource allocation.
result Significantly reduces training delay and enhances training accuracy in non-i.i.d. data environments.

SAG-VAE learns data representations and feature relations end-to-end.

problem Vanilla VAEs cannot learn relations between features.
method Inspired by Graph Neural Networks, SAG-VAE jointly infers data representations and feature relations.
result SAG-VAE generates new data via graph convolution and is robust to perturbations.

Paper studies federated nonparametric testing with privacy constraints, achieving optimal rates and adaptive testing.

problem Federated nonparametric goodness-of-fit testing under distributed differential privacy constraints.
method Establishes matching lower and upper bounds on minimax separation rate, constructs adaptive testing procedure.
result Achieves optimal rates and demonstrates phase transition phenomena in federated testing.

Aligns attention distributions for improved accuracy and robustness.

problem Improving the accuracy and robustness of neural networks using attention mechanisms.
method Alignment attention that encourages key and query distributions to match within each head.
result Alignment attention leads to better accuracy, uncertainty estimation, and robustness across various tasks.

InGRA models for efficient Granger causality learning in multivariate time series.

problem Efficiently modeling Granger causality in large-scale multivariate time series data.
method Inductive GRanger causal modeling (InGRA) framework with prototypical Granger causal attention.
result InGRA detects common causal structures and infers Granger causal structures for new individuals.

This paper improves transportation efficiency by teaching automated vehicles to cooperate.

problem Improving efficiency and safety of transportation systems with automated vehicles.
method Multi-agent graph reinforcement learning with attention mechanism.
result Automated vehicles can achieve better performance when learning to cooperate with each other.

We study the problem of distributed multi-task learning with shared representation, where each machine aims to learn a separate, but related, task in an unknown shared low-dimensional subspaces, i.e. when the predictor matrix has low rank. We consider a setting where each task is handled by a different machine, with sa…

2016-03-07abs ↗pdf ↗

Meta learns low-rank covariance factors for better uncertainty estimation.

problem Sub-optimal covariance matrices in multi-task settings.
method Meta learns diagonal or diagonal plus low-rank factors using an attentive set encoder.
result Efficiently constructed task-specific covariance matrices improve uncertainty estimation.

Sharing knowledge between tasks is vital for efficient learning in a multi-task setting. However, most research so far has focused on the easier case where knowledge transfer is not harmful, i.e., where knowledge from one task cannot negatively impact the performance on another task. In contrast, we present an approach…

2019-07-05abs ↗pdf ↗

Looped Transformers improve robustness and expressivity in in-context learning for diverse tasks.

problem Improving robustness and expressivity in in-context learning for diverse tasks.
method Study in-context linear regression with diverse tasks, focusing on depth and looping.
result Looped Transformers exhibit similar expressive power and are provably robust under mild assumptions.

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 ↗

Study compares deep learning models for traffic forecasting, highlighting graph elements' impact.

problem Challenges in forecasting spatial-temporal traffic patterns.
method In-depth comparative study of four deep neural network models with different basic elements.
result Graph attention improves long-term predictions in traffic forecasting models.

Deep generative models are attracting great attention as a new promising approach for molecular design. All models reported so far are based on either variational autoencoder (VAE) or generative adversarial network (GAN). Here we propose a new type model based on an adversarially regularized autoencoder (ARAE). It basi…

2019-11-13abs ↗pdf ↗