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

2.0%4.0%6.0%8.0% · Apr 202019922001200920172026
48 results for attribute extraction

LLM extracts actionable insights from customer reviews.

problem Extracting actionable insights from customer reviews.
method Large language model approach distinguishing perceptual attributes from actionable features.
result High consistency and predictive validity of LLM insights compared to human coders.

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 ↗

Archipelago provides interpretable explanations of feature interactions in machine learning models.

problem Interpreting the impact of feature interactions on predictions in machine learning models.
method Archipelago is a novel framework for extracting and attributing feature interactions in a scalable and interpretable manner.
result Archipelago provides significantly more interpretable explanations of feature interactions than comparable methods.

TXtract extracts structured knowledge from thousands of product categories.

problem Extracting structured knowledge from diverse product categories in e-commerce.
method TXtract uses a taxonomy-aware model with category conditional self-attention and multi-task learning.
result TXtract outperforms state-of-the-art approaches by up to 10% in F1 and 15% in coverage across all categories.

Paper defends sensitive attributes in GNNs from inference attacks.

problem Protecting sensitive attributes in GNNs from inference attacks.
method Proposes adversarial training with TV and Wasserstein distance to locally filter sensitive attributes.
result Framework creates strong defense against inference attacks with minimal performance loss.

Robustly detects and attributes climate change impacts under interventions.

problem Detect and attribute climate change impacts from observations robustly.
method Supervised learning with anchor regression for robust predictions under interventions.
result CO2 forcing can be robustly predicted from temperature patterns under strong solar forcing interventions.

Graph Prototypical Networks improve few-shot node classification on attributed networks.

problem Few-shot node classification in attributed networks with limited labeled instances.
method Graph Prototypical Networks (GPN) using meta-learning to extract meta-knowledge and identify informative labeled instances.
result GPN achieves superior performance in few-shot node classification.

Extends Tanimoto kernel to real-valued functions.

problem Measuring similarity between real-valued functions.
method Unified representation of real-valued functions via sets, derived general form of the kernel, explicit feature representation, and smooth approximation.
result General Tanimoto kernel for real-valued functions.

WassersteinGrad improves weather forecasting explanations by addressing geometric misalignment issues.

problem Improving explainability of autoregressive neural predictions on dynamic physical fields.
method WassersteinGrad, a geometric consensus method for averaged perturbed attribution maps.
result WassersteinGrad provides more accurate explanations for weather forecasting models.

The input data features set for many data driven tasks is high-dimensional while the intrinsic dimension of the data is low. Data analysis methods aim to uncover the underlying low dimensional structure imposed by the low dimensional hidden parameters by utilizing distance metrics that consider the set of attributes as…

2016-06-28abs ↗pdf ↗

TIPRDC anonymizes data features to protect privacy while retaining useful information.

problem Privacy concerns from crowdsourced data hinder deep learning applications.
method Hybrid training method combining adversarial and mutual information estimation.
result Feature extractor hides private information while preserving original data features.

EGFC learns from streaming data to classify power quality disturbances.

problem Real-time detection and classification of power quality disturbances.
method Evolving Gaussian Fuzzy Classification (EGFC) framework with semi-supervised learning.
result Encouraging classification results from online data streams.

Generative model prices options and extracts risk-neutral densities.

problem Price options and extract risk-neutral densities from market data.
method Model log-returns as a generative model, using neural nets for location, scale, and higher-order moments, with stringent conditions to avoid arbitrage.
result The model efficiently generates samples to price options and accommodates diverse risk-neutral densities.

Introduction. Case Based Reasoning (CBR) is an emerg- ing decision making paradigm in medical research where new cases are solved relying on previously solved similar cases. Usually, a database of solved cases is provided, and every case is described through a set of attributes (inputs) and a label (output). Extracting…

2013-03-07abs ↗pdf ↗

Numerous important problems can be framed as learning from graph data. We propose a framework for learning convolutional neural networks for arbitrary graphs. These graphs may be undirected, directed, and with both discrete and continuous node and edge attributes. Analogous to image-based convolutional networks that op…

2016-05-17abs ↗pdf ↗

Study predicts social relationships using triadic influence from social networks.

problem Difficulty in quantifying social relationships and their dynamics.
method Real social networks of 13 schools, neural networks, high-dimensional embedding.
result Triadic influence achieves highest accuracy in predicting student relationships.

CAWs learn temporal network dynamics without node identities or edge attributes.

problem Learning temporal network dynamics without node identities or edge attributes.
method Causal Anonymous Walks (CAWs) using temporal random walks and hitting counts.
result CAW-N outperforms previous methods in predicting links over 6 real temporal networks.

NetRCA algorithm locates network faults by analyzing derived features and leveraging unlabeled data.

problem Locating the true root cause of network faults is challenging due to complex architectures and limited labeled data.
method NetRCA algorithm extracts derived features, generates new training data, and combines multiple models to enhance performance.
result NetRCA outperforms existing methods in fault cause localization on real-world data.

Study analyzes feedback complexity for sparse feature retrieval in deep networks.

problem Learning sparse superposed features with feedback.
method Analysis of feedback complexity in sparse settings, including triplet comparisons.
result Establishes tight bounds and strong upper bounds for feature recovery.

This paper tackles spatio-temporal information preservation in machine learning.

problem Conventional machine learning assumes orthogonal data attributes, disrupting spatio-temporal information.
method Shift-invariant k-means, convolutional dictionary learning, and spatio-temporal hypercomplex encoding schemes are proposed.
result Gabor feature extraction outperforms convolutional dictionary learning in spatio-temporal information preservation.

The GANs are generative models whose random samples realistically reflect natural images. It also can generate samples with specific attributes by concatenating a condition vector into the input, yet research on this field is not well studied. We propose novel methods of conditioning generative adversarial networks (GA…

2016-11-04abs ↗pdf ↗