This paper presents a Semantic Attribute Modulation (SAM) for language modeling and style variation. The semantic attribute modulation includes various document attributes, such as titles, authors, and document categories. We consider two types of attributes, (title attributes and category attributes), and a flexible a…
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
48 results for “Attribute Generation”
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…
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.…
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 …
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.
SLOGAN improves GANs' conditional generation by balancing latent attribute distributions.
problem Imbalanced latent attribute distributions in GANs.
method Stein latent optimization with a Gaussian mixture prior and contrastive loss.
result SLOGAN achieves state-of-the-art unsupervised conditional generation performance.
Adapts IG for better feature attributions and robustness.
problem Reliability concerns in feature attributions for deep learning models.
method Adaptation of path-based feature attribution to Riemannian geometry of data manifolds.
result IG along geodesics generates more intuitive and robust explanations.
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.
Study reveals attributes help in few-shot classification generalization.
problem Understanding what makes some novel classes easier to learn.
method Defined attributes to quantify concept relatedness, used supervised and self-supervised learning.
result Combining self-supervised pretraining with supervised finetuning improves generalization.
Generic generation and manipulation of text is challenging and has limited success compared to recent deep generative modeling in visual domain. This paper aims at generating plausible natural language sentences, whose attributes are dynamically controlled by learning disentangled latent representations with designated…
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.
Meta-Learned Attribute Self-Interaction Network for Continual and Generalized Zero-Shot Learningcs.CV
MAIN network learns attributes without unseen class attributes for faster, more adaptable ZSL.
problem Learning unseen categories without known attributes and handling continual learning.
method Meta-learning attribute self-interaction network with inverse regularization.
result Main network outperforms state-of-the-art ZSL methods without unseen class attributes.
Concept modulation models unify identifiability and extrapolation in conditional latent variable models.
problem Reliable generalization in conditional latent variable models
method Concept modulation models (CMMs) with structure
result Lifts identifiability to conditional settings and controls extrapolation through attribute potentials.
New model generates unseen attribute combinations from limited data.
problem Lack of generalization in deep generative models for unseen attribute combinations.
method Introduces multilinear latent conditioning to capture multiplicative interactions.
result Demonstrates effectiveness on MNIST, Fashion-MNIST, and CelebA datasets.
Paper tackles source attribution for LLM-generated texts.
problem Identify the data provider of synthetic texts generated by LLMs.
method Watermarking to embed information about data providers in synthetic texts.
result Proposes and evaluates a source attribution framework that achieves effective source attribution.
In this work, we address the problem of modifying textual attributes of sentences. Given an input sentence and a set of attribute labels, we attempt to generate sentences that are compatible with the conditioning information. To ensure that the model generates content compatible sentences, we introduce a reconstruction…
GGDA simplifies DA for large models, speeding up attribution by up to 50x.
problem Computational intensity of existing DA methods limits their applicability to large-scale models.
method Generalized Group Data Attribution (GGDA) framework attributing to groups of training points.
result GGDA achieves up to 50x speedups over standard DA methods while maintaining effectiveness.
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.
In this work we present the novel ASTRID method for investigating which attribute interactions classifiers exploit when making predictions. Attribute interactions in classification tasks mean that two or more attributes together provide stronger evidence for a particular class label. Knowledge of such interactions make…
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.
Assessment of the Reliablity of a Model's Decision by Generalizing Attribution to the Wavelet Domaincs.CV
WCAM assesses neural network reliability by attributing decisions to wavelet scales.
problem Challenges in evaluating neural network reliability and feature robustness.
method Introduces WCAM, a wavelet-based attribution method to assess decision reliability.
result WCAM reveals where and on what scales a model focuses, enabling reliable decision assessment.
I consider how to influence CycleGAN, image-to-image translation, by using additional constraints from a neural network trained on art composition attributes. I show how I trained the the Art Composition Attributes Network (ACAN) by incorporating domain knowledge based on the rules of art evaluation and the result of a…
Algorithm uncovers latent attribute graph from molecular data.
problem Learning latent representations and interpreting them for limited data.
method Perturbation experiments on latent codes of a generative autoencoder.
result Effective graphical model of latent codes and attributes.
Framework learns dynamic graph attributes and links co-evolution.
problem Forecasting change of node attributes and link formation in dynamic graphs.
method CoEvoGNN framework with temporal self-attention and joint optimization.
result Framework outperforms baselines on predicting unseen graph snapshots.
In-Run Data Shapley offers efficient data attribution for large-scale models.
problem Existing data attribution methods are computationally intensive and cannot target specific models.
method In-Run Data Shapley, which efficiently attributes data contributions to a specific model without re-training.
result In-Run Data Shapley achieves significant efficiency, enabling data attribution for pretraining models.
This paper presents the Variation Network (VarNet), a generative model providing means to manipulate the high-level attributes of a given input. The originality of our approach is that VarNet is not only capable of handling pre-defined attributes but can also learn the relevant attributes of the dataset by itself. Thes…
Proposes GNAN model for detecting various network structures.
problem Detecting traditional communities in networks.
method GNAN model combining topology and node-attribute information.
result GNAN detects a broader range of network structures.
The paper formalizes feature attribution to address inconsistent definitions and evaluate methods.
problem Inconsistent definitions of feature relevance in feature attribution.
method Formalization based on relaxed functional dependence, extended to instance-wise setting.
result State-of-the-art methods often fail to verify necessary properties for candidate selection.
A new model detects complex network communities using node attributes.
problem Lack of methods integrating node attributes for community detection in attributed networks.
method BCSBM model that integrates betweenness centrality and clustering coefficient of nodes.
result BCSBM model outperforms other methods in detecting various network structures.
Attributing forecast gaps to component models in complex model suites
problem Attributing forecast gaps between model-suite forecasts and realized outcomes
method Formalizing walk analysis and adapting order-independent attribution frameworks
result Deriving efficient formulas for elementwise and vectorized gap attribution
Generative model tackles inconsistent attributes across datasets by enabling precise conditional generation.
problem Inconsistent attributes across merged datasets limit controllability in conditional generative modeling.
method Diffusion Model with Double Guidance, maintaining control over multiple conditions without joint annotations.
result Outperforms baselines in molecular and image generation tasks, aligning with target distributions and controlling missing conditions.
The paper tackles attributing forecast gaps in complex model suites.
problem Attributing forecast gaps to individual component models in complex model suites.
method Formalized walk analysis, adapted LMDI and Shapley value approaches.
result Developed efficient formulas for gap attribution in practical portfolio-scale examples.
StylEx trains a GAN to explain classifier decisions in StyleSpace.
problem Creating meaningful image-specific explanations for classifier decisions.
method Training a StyleGAN to learn a classifier-specific StyleSpace, incorporating the classifier model.
result StylEx finds attributes that align with semantic ones and generates human-interpretable explanations.
Nonparametric method measures influence of training images on diffusion model outputs.
problem Quantifying influence of individual training examples on diffusion model outputs.
method Patch-level similarity between generated and training images, using optimal score function.
result Strong attribution performance, matching gradient-based approaches and outperforming baselines.
This work tackles community detection in networks with node attributes, achieving exact recovery.
problem Community detection in networks with correlated node attributes.
method Information-theoretic criterion and iterative clustering algorithm maximizing joint likelihood.
result Exact recovery of community labels under a general model for network and node attributes.
In principle, zero-shot learning makes it possible to train a recognition model simply by specifying the category's attributes. For example, with classifiers for generic attributes like \emph{striped} and \emph{four-legged}, one can construct a classifier for the zebra category by enumerating which properties it posses…
Attributed network embedding has attracted plenty of interest in recent years. It aims to learn task-independent, low-dimensional, and continuous vectors for nodes preserving both topology and attribute information. Most of the existing methods, such as random-walk based methods and GCNs, mainly focus on the local info…
Attribution methods have been developed to explain the decision of a machine learning model on a given input. We use the Integrated Gradient method for finding attributions to define the causal neighborhood of an input by incrementally masking high attribution features. We study the robustness of machine learning model…
New findings show local attributions can't be both robust and provide recourse.
problem Ensuring machine learning systems are accountable and provide actionable recourse options.
method Formal definition of recourse sensitivity and counterexamples for popular attribution methods.
result It is impossible for any single attribution method to be both robust and provide recourse.
Paper develops methods for fair insurance pricing without direct access to sensitive attributes.
problem Fairness in insurance pricing with restricted access to sensitive attributes.
method Develops statistical methods for estimating discrimination-free premiums using privatized sensitive attributes.
result The proposed methods enable fair insurance pricing while respecting privacy and regulatory constraints.
Greedy PIG adapts integrated gradients for better feature attribution.
problem Interpreting deep learning model predictions.
method Unified discrete optimization framework for feature attribution and selection.
result Greedy PIG improves feature attribution on various tasks.
Unified causal model improves controllable text generation without bias.
problem Controllable text generation tasks, biased by prior models.
method Unified causal framework for attribute-conditional generation and text attribute transfer.
result Significant superiority over previous conditional models for improved control and reduced bias.
An emerging problem in trustworthy machine learning is to train models that produce robust interpretations for their predictions. We take a step towards solving this problem through the lens of axiomatic attribution of neural networks. Our theory is grounded in the recent work, Integrated Gradients (IG), in axiomatical…
We explore a new domain of learning to infer user interface attributes that helps developers automate the process of user interface implementation. Concretely, given an input image created by a designer, we learn to infer its implementation which when rendered, looks visually the same as the input image. To achieve thi…
Product categorization using text data for eCommerce is a very challenging extreme classification problem with several thousands of classes and several millions of products to classify. Even though multi-class text classification is a well studied problem both in academia and industry, most approaches either deal with …
TaylorPODA: A Taylor Expansion-Based Method to Improve Post-Hoc Attributions for Opaque Modelsstat.ML
TaylorPODA uses Taylor expansions to improve feature attributions for opaque models.
problem Lack of systematic framework for quantifying feature contributions in opaque models.
method Taylor expansion framework with postulates (precision, federation, zero-discrepancy, adaptation).
result TaylorPODA achieves competitive results and provides principled explanations.
In many networks, vertices have hidden attributes, or types, that are correlated with the networks topology. If the topology is known but these attributes are not, and if learning the attributes is costly, we need a method for choosing which vertex to query in order to learn as much as possible about the attributes of …
CDLEEDS detects local changes in evolving data streams for accurate feature attributions.
problem Local feature attributions become obsolete in evolving data streams.
method CDLEEDS, a flexible framework for detecting local change and concept drift.
result CDLEEDS reliably detects both local and global concept drift.