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,657 papers · 148 categories

Trend · papers per month

144288431575 · Jun 202019922001200920172026
48 results for heterogeneous attribute spaces

A new method improves semi-supervised learning by handling tasks with different attribute spaces.

problem Existing methods assume tasks share the same attribute space, limiting their applicability.
method Meta-learning approach that embeds labeled and unlabeled data in task-specific spaces using neural networks.
result Improves test performance on tasks with small labeled data using unlabeled and various task data.

Enhances machine learning for dynamic, interconnected entities.

problem Lack of systematic feature engineering for dynamic, interconnected entities.
method Augments current graph machine learning with comprehensive feature engineering in space and time.
result Improves supervised learning on heterogeneous, attributed entities interacting over time.

UNTIE learns representations of coupled categorical data.

problem Challenges in learning from unlabeled categorical data with complex couplings.
method UNTIE approach for unsupervised representation learning of heterogeneous couplings.
result UNTIE significantly improves categorical data representations on 25 diverse datasets.

This paper introduces a general Bayesian non- parametric latent feature model suitable to per- form automatic exploratory analysis of heterogeneous datasets, where the attributes describing each object can be either discrete, continuous or mixed variables. The proposed model presents several important properties. First…

2017-07-26abs ↗pdf ↗

Latent feature modeling allows capturing the latent structure responsible for generating the observed properties of a set of objects. It is often used to make predictions either for new values of interest or missing information in the original data, as well as to perform data exploratory analysis. However, although the…

2017-06-12abs ↗pdf ↗

Mining tasks over sequential data, such as clickstreams and gene sequences, require a careful design of embeddings usable by learning algorithms. Recent research in feature learning has been extended to sequential data, where each instance consists of a sequence of heterogeneous items with a variable length. However, m…

2019-11-03abs ↗pdf ↗

A new method for name disambiguation in academic networks using multi-view attention and recurrent neural networks.

problem Disambiguating authors with the same name in large-scale academic networks.
method Multi-view Attention-based Pairwise Recurrent Neural Network (MA-PairRNN) that divides papers into blocks based on author attributes and merges blocks of the same author.
result MA-PairRNN significantly improves name disambiguation performance on real-world datasets.

Paper proposes a method to detect fair communities in graphs considering demographic attributes.

problem Inconsistent community detection violates fairness constraints for nodes with demographic attributes.
method Develops an 1\ell_1-regularized pseudo-likelihood approach for fair graphical model selection.
result The method ensures demographic groups are fairly represented within detected communities.

ICAM creates interpretable feature attribution maps for brain images.

problem Challenges in predicting class relevance from brain images due to heterogeneity and background variation.
method A VAE-GAN framework for disentangling class relevance from background features.
result FA maps generated by ICAM outperform baseline methods and support phenotype variation exploration.

FairMixRep learns fair representations from mixed data types.

problem Representation learning in mixed numerical and categorical data with fairness constraints.
method Efficient encoder-decoder framework + fairness constraints.
result Excellent performance in preserving information and fairness in mixed data representations.

HL-VAE extends VAE for heterogeneous temporal and longitudinal data.

problem Handling heterogeneous data in temporal and longitudinal datasets.
method Proposes HL-VAE, an extension of existing VAEs for temporal and longitudinal data, incorporating likelihood models for various data types.
result HL-VAE achieves competitive performance in missing value imputation and predictive accuracy.

A method for trust evaluation of devices in human-device coexistence systems.

problem Efficient trust evaluation of devices in systems with diverse physical and social attributes.
method Canonical correlation analysis-enhanced hypergraph self-supervised learning (HSLCCA).
result The proposed HSLCCA method significantly outperforms baseline algorithms in identifying trusted devices.

VHGM-MAE generates synthetic humans from healthcare data.

problem Handling high-dimensional, sparse healthcare data with missing values.
method Masked autoencoder (MAE) tailored for healthcare data, addressing heterogeneity, missingness, and high-dimensionality.
result VHGM-MAE outperforms existing methods in missing value imputation and synthetic data generation.

Graph representation learning is to learn universal node representations that preserve both node attributes and structural information. The derived node representations can be used to serve various downstream tasks, such as node classification and node clustering. When a graph is heterogeneous, the problem becomes more…

2019-11-19abs ↗pdf ↗

In the presence of weak overall correlation, it may be useful to investigate if the correlation is significantly and substantially more pronounced over a subpopulation. Two different testing procedures are compared. Both are based on the rankings of the values of two variables from a data set with a large number n of o…

2015-04-21abs ↗pdf ↗

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.

CDOT optimizes transport between domains preserving both feature and geometric structure.

problem Optimizing transport between heterogeneous domains with preserved feature and geometric structure.
method CDOT uses operator-based regularization to align distance structures, proving pseudometric properties.
result CDOT improves robustness to local geometric variations and is provably convex.

A new method corrects weight values to improve treatment effect estimation.

problem Estimating heterogeneous treatment effects in high-dimensional data with sample selection bias.
method Differentiable Pareto-Smoothed Weighting (DPSW) framework.
result Our method outperforms existing methods in treatment effect estimation.

Study copyright's impact on creative industries using AI-generated fonts.

problem Estimating supply and demand in creative industries with AI-generated content.
method Neural network embeddings, spatial regression, event-study analyses, structural model of supply and demand.
result Copyright can raise consumer welfare by encouraging product relocation.

Study analyzes fintech terms in news and blogs, revealing specialized attributes of fintech companies.

problem Understanding specialized attributes of fintech companies through term analysis.
method Large scale analysis of fintech terms in news and blogs, using complex networks and statistically validated networks.
result Companies with fintech terms have over-expressions of specific attributes related to geography and economy.

RUMBoost combines RUMs and deep learning for better choice modelling.

problem Creating interpretable and robust discrete choice models.
method Gradient Boosted Regression Trees for utility functions, with constraints for interpretability and monotonicity.
result RUMBoost outperforms ML and RUM benchmarks in predictive performance and interpretability.

Federated Learning (FL) enables learning a shared model across many clients without violating the privacy requirements. One of the key attributes in FL is the heterogeneity that exists in both resource and data due to the differences in computation and communication capacity, as well as the quantity and content of data…

2020-01-25abs ↗pdf ↗

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.

New insights into how to inspect and learn from multi-stage processes and AI reasoning.

problem Understanding how to attribute outcomes to early stages in multi-stage operations and AI reasoning.
method Information-theoretic analysis and mathematical proofs of four key results.
result Uniform checkpoint spacing is minimax-optimal for inspection design under homogeneous signal attenuation.

Digital personas improve survey results for stable attributes but fail for subjective responses.

problem When can digital personas reliably approximate human survey findings?
method Using LISS panel, constructed personas from background variables and survey histories, tested against held-out post-cutoff answers.
result Digital personas improve alignment with human response distributions for stable attributes but fail for subjective responses.

ExCIR provides efficient, consistent, and scalable explainability for complex models.

problem Complex models lack transparency and require efficient, stable, and scalable explainability methods.
method ExCIR uses correlation-aware feature attribution with robust centering and groupwise aggregation.
result ExCIR delivers trustworthy agreement with global baselines and full model rankings, reduces runtime, and scales to large datasets.

WGNN learns graph representations from incomplete attribute data.

problem Missing node attributes in graphs.
method WGNN learns node representations from decomposed attribute matrices and uses Wasserstein space for message passing.
result WGNN outperforms existing methods in node classification tasks with missing attribute data.

Social network analysis is an important problem in data mining. A fundamental step for analyzing social networks is to encode network data into low-dimensional representations, i.e., network embeddings, so that the network topology structure and other attribute information can be effectively preserved. Network represen…

2019-04-18abs ↗pdf ↗

SHAP Distance assesses semantic fidelity of synthetic tabular data.

problem Semantic fidelity of synthetic tabular data is not well evaluated.
method SHAP Distance, defined as cosine distance between global SHAP attribution vectors.
result SHAP Distance detects semantic discrepancies overlooked by standard measures.

Introduces FairCOCCO for fair learning with multitype, multivariate sensitive attributes.

problem Fairness in machine learning with multiple, complex sensitive attributes.
method FairCOCCO measure based on cross-covariance operators, incorporating a regularisation term.
result Consistent improvements in balancing fairness and predictive power on real-world datasets.