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

51102153204 · Jun 202019922001200920172026
48 results for Attribute Vectors

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 ↗

A new copula model for multi-attribute data using optimal transport.

problem Relaxing the Gaussian assumption for multi-attribute graphical models.
method Introducing a new copula (Cyclically Monotone Copula) and using optimal transport theory.
result The model allows arbitrary continuous distributions and is more flexible than classical methods.

We show new connections between adversarial learning and explainability for deep neural networks (DNNs). One form of explanation of the output of a neural network model in terms of its input features, is a vector of feature-attributions. Two desirable characteristics of an attribution-based explanation are: (1) $\texti…

2018-10-15abs ↗pdf ↗

ASTRA improves TDA by more accurately approximating iHVP.

problem Improving insights into training data attribution.
method ASTRA uses EKFAC-preconditioner on Neumann series iterations to accurately approximate iHVP.
result Improving iHVP approximation significantly improves TDA performance.

We introduce several techniques for sampling and visualizing the latent spaces of generative models. Replacing linear interpolation with spherical linear interpolation prevents diverging from a model's prior distribution and produces sharper samples. J-Diagrams and MINE grids are introduced as visualizations of manifol…

2016-09-14abs ↗pdf ↗

The stochastic block model (SBM) is a probabilistic model for community structure in networks. Typically, only the adjacency matrix is used to perform SBM parameter inference. In this paper, we consider circumstances in which nodes have an associated vector of continuous attributes that are also used to learn the node-…

2018-03-07abs ↗pdf ↗

A method for inferring graph from multivariate time series using ADMM.

problem Inferring conditional independence graph from multivariate Gaussian time series.
method Formulated as multi-attribute graph estimation, used ADMM to minimize penalized negative log-likelihood.
result Proposed method outperforms existing frequency-domain approaches in graph edge detection.

Unified analysis for graph learning from multi-attribute Gaussian time series.

problem Estimating conditional independence graph from multi-attribute Gaussian time series data.
method Unified theoretical analysis using a penalized log-likelihood objective function in the frequency domain.
result Established sufficient conditions for consistency and graph recovery in high-dimensional settings.

We consider the most common variants of linear regression, including Ridge, Lasso and Support-vector regression, in a setting where the learner is allowed to observe only a fixed number of attributes of each example at training time. We present simple and efficient algorithms for these problems: for Lasso and Ridge reg…

2012-06-18abs ↗pdf ↗

A machine learning approach to record fusion with high accuracy.

problem Aggregating multiple records corresponding to the same entity.
method Constructing feature vectors from attribute-level, record-level, and database-level signals; using a stagewise additive model to learn a classifier.
result Average precision of ~98% with source information and ~94% without source information across diverse datasets.

In this work we propose a model that can manipulate individual visual attributes of objects in a real scene using examples of how respective attribute manipulations affect the output of a simulation. As an example, we train our model to manipulate the expression of a human face using nonphotorealistic 3D renders of a f…

2019-01-28abs ↗pdf ↗

Many real world network problems often concern multivariate nodal attributes such as image, textual, and multi-view feature vectors on nodes, rather than simple univariate nodal attributes. The existing graph estimation methods built on Gaussian graphical models and covariance selection algorithms can not handle such d…

2012-10-29abs ↗pdf ↗

Bayesian approach scores influential training examples for model predictions.

problem Enhance interpretability and safety of machine learning models.
method Formulate TDA as a Bayesian information-theoretic problem, scoring subsets by information loss.
result Method aligns with classical influence scores while promoting diversity for subsets.

Paper analyzes multi-attribute data to estimate differences in Gaussian graphical models.

problem Estimating differences in two Gaussian graphical models with similar structure.
method Group lasso penalized D-trace loss function and ADMM algorithm for optimization.
result Consistency in support recovery and estimation in high-dimensional settings established.

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.

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…

2020-01-06abs ↗pdf ↗

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.

This research compares two encoding methods for categorical attributes in machine learning, affecting model fairness.

problem The impact of encoding protected categorical attributes on fairness in machine learning models.
method Comparison of one-hot encoding and target encoding methods.
result Target encoding can lead to more unfair models compared to one-hot encoding due to induced bias.

New framework improves attribution of predictive uncertainties in classification models.

problem Improper attribution of predictive uncertainties in classification tasks.
method Combines path integrals, counterfactual explanations, and generative models.
result Framework outperforms existing alternatives in quantitative evaluations.

Graph embedding methods transform high-dimensional and complex graph contents into low-dimensional representations. They are useful for a wide range of graph analysis tasks including link prediction, node classification, recommendation and visualization. Most existing approaches represent graph nodes as point vectors i…

2019-12-02abs ↗pdf ↗

New method optimizes fairness in predictive models for continuous sensitive attributes.

problem Enforcing full statistical independence on continuous sensitive attributes is too restrictive.
method Functional bilevel optimization (FBO) and ITD algorithms.
result Achieves lowest or near-lowest fairness-accuracy regret on synthetic and real datasets.

Zero-shot learning (ZSL) is a framework to classify images belonging to unseen classes based on solely semantic information about these unseen classes. In this paper, we propose a new ZSL algorithm using coupled dictionary learning. The core idea is that the visual features and the semantic attributes of an image can s…

2019-06-10abs ↗pdf ↗

Graphs (networks) are ubiquitous and allow us to model entities (nodes) and the dependencies (edges) between them. Learning a useful feature representation from graph data lies at the heart and success of many machine learning tasks such as classification, anomaly detection, link prediction, among many others. Many exi…

2017-10-25abs ↗pdf ↗

The goal of subspace learning is to find a kk-dimensional subspace of Rd\mathbb{R}^d, such that the expected squared distance between instance vectors and the subspace is as small as possible. In this paper we study subspace learning in a partial information setting, in which the learner can only observe rdr \le d att…

2014-02-19abs ↗pdf ↗

Cosmos models scenes using neural encodings and symbolic attributes for compositional generalization.

problem Modeling scenes with high performance on unseen input scenes composed of known visual elements.
method Neurosymbolic grounding with neurosymbolic scene encodings and attention mechanisms.
result Establishes a new state-of-the-art for compositional generalization in world modeling.

Current approaches for predicting sets from feature vectors ignore the unordered nature of sets and suffer from discontinuity issues as a result. We propose a general model for predicting sets that properly respects the structure of sets and avoids this problem. With a single feature vector as input, we show that our m…

2019-06-15abs ↗pdf ↗

Network embedding leverages the node proximity manifested to learn a low-dimensional node vector representation for each node in the network. The learned embeddings could advance various learning tasks such as node classification, network clustering, and link prediction. Most, if not all, of the existing works, are ove…

2017-06-06abs ↗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.

We aim to analyze the relation between two random vectors that may potentially have both different number of attributes as well as realizations, and which may even not have a joint distribution. This problem arises in many practical domains, including biology and architecture. Existing techniques assume the vectors to …

2015-10-28abs ↗pdf ↗