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

3467101134 · Jun 202019922001200920172026
48 results for Attribute sparsity

ResGCN detects anomalies in attributed networks by capturing sparsity and nonlinearity.

problem Detecting anomalous nodes in attributed networks.
method Attention-based deep residual modeling using Graph Convolutional Networks.
result ResGCN effectively detects anomalies in attributed networks.

Relational data are usually highly incomplete in practice, which inspires us to leverage side information to improve the performance of community detection and link prediction. This paper presents a Bayesian probabilistic approach that incorporates various kinds of node attributes encoded in binary form in relational m…

2017-06-14abs ↗pdf ↗

SISR improves feature attribution in complex payoff schemes.

problem Distorted feature attributions due to non-additive payoff functions and high-dimensional feature spaces.
method Sparse Isotonic Shapley Regression (SISR) learns a monotonic transformation to restore additivity and enforces L0 sparsity.
result SISR achieves strong support recovery and stable attributions across various payoff schemes.

Improved conversion rate prediction in online advertising using self-supervised pre-training.

problem Data sparsity and calibration issues in predicting conversions given clicks.
method Self-supervised pre-training on all conversion events to enrich CVR prediction model without compromising calibration.
result Improvements in offline training and online A/B tests, with full deployment to Yahoo native advertising system.

New algorithm tackles subgroup fairness in AI with multiple sensitive attributes.

problem Heavy computational burdens and data sparsity in subgroup fairness for multiple sensitive attributes.
method Doubly Regressing Adversarial learning (DRAF) for subgroup fairness, focusing on subgroups with sufficient sample sizes and marginal fairness.
result DRAF algorithm reduces a surrogate fairness gap for supIPM with less computation than directly reducing supIPM.

TSInsight improves interpretability of deep time-series models.

problem Lack of interpretability methods for time-series data.
method Attach auto-encoder to classifier with sparsity-inducing norm, fine-tune based on gradients and reconstruction penalty.
result TSInsight effectively boosts interpretability of deep time-series models.

Efficient method certifies robustness of discrete data models, especially graphs.

problem Certifying robustness of discrete data models, especially graphs, is difficult.
method Randomized smoothing framework, sparsity-aware, model-agnostic, tight and efficient.
result Proposes a scalable method for certifying robustness of discrete data models, especially graphs.

CoT improves transformer sample efficiency by reducing input token dependencies and attention sparsity.

problem Transformer sample inefficiency in simple tasks.
method Demonstrated through parity-learning setup, showing CoT reduces required samples from exponential to polynomial.
result Transformer learns function within polynomial samples with CoT, requiring exponential samples without CoT.

Intersectionality is a framework that analyzes how interlocking systems of power and oppression affect individuals along overlapping dimensions including race, gender, sexual orientation, class, and disability. Intersectionality theory therefore implies it is important that fairness in artificial intelligence systems b…

2018-11-18abs ↗pdf ↗

To alleviate sparsity and cold start problem of collaborative filtering based recommender systems, researchers and engineers usually collect attributes of users and items, and design delicate algorithms to exploit these additional information. In general, the attributes are not isolated but connected with each other, w…

2019-03-18abs ↗pdf ↗

Exact Gaussian Processes for massive datasets using non-stationary sparsity-discovering kernels.

problem High computational and storage costs for exact GPs in large datasets.
method Develop non-stationary kernels that allow the GP to discover sparse structure naturally.
result Exact Gaussian Processes scalable to over 5 million data points.

Pruning improves model generalization in over-parameterized models, contradicting traditional theories.

problem Pruning's effect on generalization in over-parameterized models.
method Empirical study on standard pruning algorithms and additional regularization effects.
result Pruning leads to better training and regularization, improving generalization.

Active learning (AL) on attributed graphs has received increasing attention with the prevalence of graph-structured data. Although AL has been widely studied for alleviating label sparsity issues with the conventional non-related data, how to make it effective over attributed graphs remains an open research question. E…

2019-08-22abs ↗pdf ↗

This paper introduces a new data-driven methodology for estimating sparse covariance matrices of the random coefficients in logit mixture models. Researchers typically specify covariance matrices in logit mixture models under one of two extreme assumptions: either an unrestricted full covariance matrix (allowing correl…

2020-01-14abs ↗pdf ↗

Researchers improve transformer networks' optimization and understanding.

problem Improving the understanding and optimization of transformer networks.
method Introducing a convex alternative to the self-attention mechanism and reformulating the training problem as a convex optimization problem.
result Revealed an implicit regularization mechanism that promotes sparsity across tokens.

Proposes a Taylor framework to unify and analyze attribution methods.

problem Lack of a unified guideline for feature contribution assignment in machine learning models.
method Introduces a Taylor attribution framework to model the attribution problem and reformulates fourteen mainstream methods.
result Empirically validates the Taylor reformulations and reveals a positive correlation between performance and principles followed.

Unified framework for analyzing machine learning model attributions.

problem Lack of a general and theoretical framework for understanding attribution methods.
method Proposes a Taylor attribution framework to unify and analyze seven mainstream attribution methods.
result Established three principles for good attribution and empirically validated the Taylor reformulations.

Facial attribute editing aims to manipulate single or multiple attributes of a face image, i.e., to generate a new face with desired attributes while preserving other details. Recently, generative adversarial net (GAN) and encoder-decoder architecture are usually incorporated to handle this task with promising results.…

2017-11-29abs ↗pdf ↗

Wavelet Attribution Method (WAM) improves feature attribution for deep models.

problem Inability of pixel-based heatmaps to capture data structure and variability in feature attribution.
method Wavelet domain for feature attribution, leveraging spatial and scale-localized properties of wavelet coefficients.
result WAM provides quantitatively superior explanations across audio, image, and volume modalities.

Proposes VCLANC for attributed network clustering using node and attribute embeddings.

problem Lack of mutual affinity exploitation between nodes and attributes in graph convolution.
method Dual variational auto-encoders for node and attribute embeddings, Gaussian mixture model priors, mutual distance and clustering assignment hardening losses.
result Demonstrates effectiveness on real-world attributed network datasets.

Unified analysis of removal-based feature attributions robustness.

problem Robustness of removal-based feature attributions is not well understood.
method Theoretical analysis and upper bounds derivation for removal-based feature attributions under input and model perturbations.
result Upper bounds for the difference between intact and perturbed attributions derived under various perturbation settings.

A new method for disentangled latent spaces in VAEs that can manipulate attributes.

problem Disentangled representation of attributes in latent spaces of VAEs.
method Attribute-based regularization loss to enforce monotonic relationships between attributes and latent codes.
result Manipulation of attributes in latent spaces post-training.

Graph structured data provide two-fold information: graph structures and node attributes. Numerous graph-based algorithms rely on both information to achieve success in supervised tasks, such as node classification and link prediction. However, node attributes could be missing or incomplete, which significantly deterio…

2019-07-23abs ↗pdf ↗

We are interested in attribute-guided face generation: given a low-res face input image, an attribute vector that can be extracted from a high-res image (attribute image), our new method generates a high-res face image for the low-res input that satisfies the given attributes. To address this problem, we condition the …

2017-05-28abs ↗pdf ↗

In many graphs such as social networks, nodes have associated attributes representing their behavior. Predicting node attributes in such graphs is an important problem with applications in many domains like recommendation systems, privacy preservation, and targeted advertisement. Attributes values can be predicted by a…

2019-12-27abs ↗pdf ↗

Study improves stock movement prediction using multimodal data.

problem Inaccurate stock movement prediction due to incomplete multimodal data integration.
method Introduces MSGCA framework for robust multimodal fusion.
result MSGCA framework outperforms existing methods by 21.7% on multimodal datasets.

Spike-and-Slab Deep Learning (SS-DL) is a fully Bayesian alternative to Dropout for improving generalizability of deep ReLU networks. This new type of regularization enables provable recovery of smooth input-output maps with unknown levels of smoothness. Indeed, we show that the posterior distribution concentrates at t…

2018-03-24abs ↗pdf ↗

New method separates graph structure from node attributes to recover lost signal.

problem Standard representation learning on attributed graphs merges incompatible metric spaces, leading to geometrically flawed alignment.
method Custom variational autoencoder that separates manifold learning from structural alignment.
result Transforms geometric conflict into interpretable structural descriptor, uncovering connectivity patterns and anomalies.

New method builds complex networks from attribute interactions without normalization.

problem Improving high-level classification algorithms by capturing hidden attribute interactions.
method Proposes a new complex network building methodology based on attribute-attribute interactions, avoiding normalization.
result Demonstrates improved performance in high-level classification techniques.

We develop a real-time anomaly detection algorithm for directed activity on large, sparse networks. We model the propensity for future activity using a dynamic logistic model with interaction terms for sender- and receiver-specific latent factors in addition to sender- and receiver-specific popularity scores; deviation…

2019-11-13abs ↗pdf ↗

RoSHAP stabilizes feature attribution in machine learning models.

problem Stochastic variation in feature attribution measures.
method Modeling feature attribution score distribution and estimating it through bootstrap resampling and kernel density estimation.
result RoSHAP provides stable feature rankings and improves model performance.

Method generates time-series attribution maps with identifiability guarantees.

problem Lack of identifiability guarantees in gradient-based attribution methods.
method Regularized contrastive learning algorithm trained on time-series data.
result Empirically shows robust approximation of zero vs. non-zero entries in the ground-truth attribution map.