Paper tackles efficient training of linear models on manycore processors.
problem Training generalized linear models on manycore processors efficiently.
method Proposes Heterogeneous Tasks on Homogeneous Cores (HTHC) approach for parallelism.
result Improves state-of-the-art Lasso training by an order of magnitude.
AEGCN uses autoencoder constraints to improve graph node classification.
problem Node classification on graph domains with reduced information loss.
method Autoencoder-constrained graph convolutional network (AEGCN).
result Adding autoencoder constraints significantly improves graph convolutional network performance.
GTNs learn new graph structures and improve node representation learning.
problem Learning node representations on misspecified or heterogeneous graphs.
method Graph Transformer Networks (GTNs) that generate new graph structures and learn effective node representations.
result GTNs achieve state-of-the-art performance in node classification tasks without predefined meta-paths.
A new tensor model captures complex structures in heterogeneous data.
problem Complex joint and discriminative structures in heterogeneous datasets.
method Double core tensor factorization with smoothing loss functions and linearized ADMM.
result The model accurately estimates factors even with missing entries.
New asynchronous SGD algorithms achieve optimal performance in distributed learning.
problem Asynchronous training introduces staleness, complicating optimization analysis.
method Developed rigorous framework for asynchronous first order stochastic optimization.
result Asynchronous SGD can achieve optimal time complexity, matching synchronous methods.
New method for learning on heterogeneous graphs without meta-paths.
problem Learning on heterogeneous graphs is sensitive to meta-paths choice, leading to poor performance.
method Decompose heterogeneous graph into homogeneous relation-type graphs, combine higher-order representations, use attention mechanisms.
result Our model outperforms state-of-the-art baselines in vertex classification tasks on heterogeneous graph datasets.
Domain adaptation leverages the knowledge in one domain - the source domain - to improve learning efficiency in another domain - the target domain. Existing heterogeneous domain adaptation research is relatively well-progressed, but only in situations where the target domain contains at least a few labeled instances. I…
This study analyzes cryptocurrencies to reveal their homogeneity and heterogeneity.
problem Exploring the homogeneity and heterogeneity of cryptocurrency market performance and popularities.
method Examined 3607 actively exchanged cryptocurrencies to analyze their prices, volumes, blockchain transactions, coin difficulties, and public opinion.
result Identified strong correlation in market performance and imbalance in popularities and sophistications.
Graph attention networks improve performance on heterogeneous graphs.
problem Complex performance of GNNs on heterogeneous graphs.
method Integrating positional encodings into graph attention networks.
result Graph attention networks excel in node classification and link prediction.
HDGI learns node representations for heterogeneous graphs.
problem Challenges in learning node representations for heterogeneous graphs.
method HDGI uses meta-path structure, graph convolution, and semantic-level attention to maximize local-global mutual information.
result HDGI outperforms state-of-the-art methods on graph-related tasks.
PINE embeds graph nodes flexibly, capturing any neighbor dependency.
problem Learning flexible node representations from graph neighborhoods.
method PINE uses partial permutation invariant set functions to capture any possible neighbor dependencies.
result PINE outperforms state-of-the-art methods on various graph learning tasks.
Polynomial-time test for detecting dense subgraphs in heterogeneous networks.
problem Detecting a planted community in heterogeneous networks.
method Proposes a polynomial-time test with a standard normal distribution null limiting distribution.
result The test is efficient and performs well in both simulations and real data.
Paper studies embedding conditions for homogeneous quandles.
problem Embedding problem of homogeneous quandles.
method Necessary and sufficient condition for quandle homomorphisms to be embeddings.
result Generalization of embedding theorem for generalized Alexander quandles.
We extend the notion of a fundamental negatively Z-graded Lie algebra mx=⨁p≤−1mxp associated to any point of a Levi nondegenerate CR manifold to the class of k-nondegenerate CR manifolds (M,D,J) for all k≥2 and call this invariant the core …
Bi-directional Curriculum Learning improves graph anomaly detection by considering both homogeneity and heterogeneity.
problem Existing graph anomaly detection methods often ignore the different contributions of nodes to training.
method Introduces Bi-directional Curriculum Learning (BCL) to optimize GAD methods by considering both homogeneity and heterogeneity of nodes.
result Extensive experiments show that BCL significantly improves the performance of GAD anomaly detection models.
DyHATR learns dynamic heterogeneous networks for better link prediction.
problem Learning effective representations of dynamic heterogeneous networks for link prediction.
method Hierarchical attention for heterogeneous information and temporal RNN for evolutionary patterns.
result DyHATR significantly outperforms state-of-the-art baselines on link prediction tasks.
Meta-BO method clusters and learns from prior tasks to optimize heterogeneous functions.
problem Optimizing multiple functions with historical data and scalability issues.
method Clustering-based meta-learning, surrogate prototypes, adaptive weighting policies.
result Scalable and robust meta-BO method improves convergence to global optimum.
In ensemble methods, the outputs of a collection of diverse classifiers are combined in the expectation that the global prediction be more accurate than the individual ones. Heterogeneous ensembles consist of predictors of different types, which are likely to have different biases. If these biases are complementary, th…
The paper introduces heterogeneous manifolds for better graph embeddings.
problem Graph embeddings in Euclidean spaces often fail to capture the curvature of real-world graphs.
method The authors propose heterogeneous rotationally-symmetric manifolds with a radial dimension to account for varying curvature.
result The method improves graph embeddings by better preserving high-order structures and heterogeneous random graphs.
In this paper, we study the problem of author identification under double-blind review setting, which is to identify potential authors given information of an anonymized paper. Different from existing approaches that rely heavily on feature engineering, we propose to use network embedding approach to address the proble…
New method for clustering tasks with heterogeneous data.
problem Clustered multitask learning with semiparametric and heterogeneous nuisances.
method Adaptive fused orthogonal estimator with Neyman-orthogonal losses and data-driven fusion penalties.
result Achieves exact clustering recovery and pooled parametric convergence rates.
HGT models heterogeneous graphs with dedicated node and edge representations.
problem Infeasibility of existing GNNs for heterogeneous graphs.
method Node- and edge-type dependent parameters, relative temporal encoding, heterogeneous mini-batch graph sampling.
result HGT outperforms state-of-the-art GNNs by 9%--21% on various downstream tasks.
Graph neural networks improve topology control of power grids.
problem Grid congestion due to renewable energy and electrification.
method Investigated the effect of graph representation on GNN effectiveness for topology control.
result Heterogeneous graph representation outperforms homogeneous in topology control tasks.
Proposes a method to preserve information in heterogeneous domain adaptation.
problem Preserving information in different feature spaces between domains.
method Joint information preservation method integrating paired and structural information.
result Superior performance compared to state-of-the-art HDA algorithms.
A new method detects communities in multi-relational networks.
problem Detect communities in heterogeneous multi-relational networks.
method Message passing based algorithm on a hierarchical structure of homogeneous networks.
result Effectiveness of the proposed method confirmed on synthetic and real-world networks.
Proposes a hybrid model for stock market report classification using graph neural networks.
problem Lack of unified node embeddings for heterogeneous graphs in text datasets.
method Transductive hybrid approach combining unsupervised node representation learning and supervised node classification/edge prediction.
result Demonstrates the model's ability to classify stock market technical analysis reports.
Paper introduces HGSL for heterogeneous graphs, improving edge type and weight recovery.
problem Learning structure in heterogeneous graphs with multiple node and edge types.
method Proposes H2MN model for DGPs and derives alternating optimization method.
result Demonstrates superior performance on synthetic and real-world datasets.
New algorithm tackles heterogeneous curvature in online convex optimization.
problem Adversarial bandit convex optimization with varying curvature.
method Developed an adaptive algorithm that learns curvature on the fly.
result Achieves optimal regret bounds even with heterogeneous curvature.
Generative models unify heterogeneous data for multimodal fusion.
problem Learning effective representations of mixed numerical and categorical data.
method Bayesian approach with exponential family distributions and Laplace-Bernstein approximation.
result Generative models enable fusion of multimodal data for various machine learning tasks.
Transmeter quickly measures transferability between different datasets.
problem Measuring transferability between heterogeneous multivariate datasets.
method Pre-trained source model, adversarial network, and encoder-decoder architecture.
result Transmeter provides the most accurate transferability measurement up to 10.3 times faster.
In this paper, we consider the problem of event classification with multi-variate time series data consisting of heterogeneous (continuous and categorical) variables. The complex temporal dependencies between the variables combined with sparsity of the data makes the event classification problem particularly challengin…
GDA-HIN adapts across heterogeneous networks by aligning shared and private node types.
problem Domain adaptation challenges in heterogeneous networks with shared and private node types.
method Generalized Domain Adaptive model across HINs (GDA-HIN) that aligns identical-type nodes and edges while utilizing different-type nodes and edges.
result GDA-HIN outperforms state-of-the-art methods in various domain adaptation tasks across heterogeneous networks.
Model shows how heterogeneity in strategies and risk tolerance affects financial market stability.
problem Understanding how heterogeneity impacts financial market dynamics.
method Agent-based model incorporating heterogeneous investment strategies and risk tolerance.
result Heterogeneity in strategies and risk tolerance suppresses price fluctuations.
We propose a statistical model for weighted temporal networks capable of measuring the level of heterogeneity in a financial system. Our model focuses on the level of diversification of financial institutions; that is, whether they are more inclined to distribute their assets equally among partners, or if they rather c…
Game-theoretic model captures investor interactions for stock price forecasting.
problem Complex market dynamics driving stock price movements.
method Game-theoretic modeling of heterogeneous investor interactions in a dynamic graph structure.
result Our method outperforms state-of-the-art stock price forecasting methods.
New strategies improve multi-agent decision-making on irregular networks.
problem Maximizing group reward in multi-agent settings with heterogeneous strategies.
method Design and analysis of heterogeneous explore-exploit strategies for multi-star networks.
result Group performance improves under heterogeneous strategies compared to homogeneous strategies.
Proposes HetSANN for learning heterogeneous graph structures without meta-paths.
problem Learning low-dimensional vector space of heterogeneous information networks.
method Implicitly represents heterogeneous information through entity space transformation and attention mechanism.
result Significant improvements over state-of-the-art solutions on public datasets.
V1 cortex reconstructs images as Poisson equation solutions with varying weights.
problem Reconstructing images from V1 cortical cell receptive profiles.
method Solves a heterogeneous Poisson equation with varying weights representing neural connectivity.
result Reconstructions converge to homogeneous solutions using homogenization techniques.
Hyper-SAGNN learns patterns in hypergraphs for complex interactions.
problem Learning patterns in hypergraphs with variable-sized heterogeneous hyperedges.
method Self-attention based graph neural network for homogeneous and heterogeneous hypergraphs.
result Significantly outperforms state-of-the-art methods on various tasks.
Proposes a method for private aggregation in heterogeneous federated learning.
problem Ensuring resilience to Byzantine clients and maintaining client data privacy in federated learning with heterogeneous data.
method Careful co-design of verifiable secret sharing, secure aggregation, and private information retrieval scheme.
result Achieves information-theoretic privacy guarantees and Byzantine resilience under data heterogeneity.
This study generalizes an econophysics model to account for trader heterogeneity, finding robust power-law exponents but sensitive prefactors.
problem The original Lillo-Mike-Farmer model assumed homogeneity in traders' order-splitting strategies, which this study generalizes.
method The study proposes a generalised Lillo-Mike-Farmer model and solves it exactly without heuristic assumptions.
result The power-law exponent in the order-sign ACF is robust for arbitrary heterogeneous intensity distributions, but the prefactor is sensitive to heterogeneity.
SHIFT method optimally estimates heterogeneous discrete distributions with limited communication.
problem Collaborative learning of discrete distributions under heterogeneity and communication constraints.
method Two-stage method: First, users learn a central distribution; then, fine-tune this to estimate individual distributions.
result SHIFT is minimax optimal in the model of heterogeneity and under communication constraints.
Characterizes uncertainty in low-rank matrix completion with noisy data.
problem Uncertainty quantification in low-rank matrix completion with heterogeneous sub-exponential noise.
method Characterizes the distribution of estimated matrix entries under low-rank estimators with heterogeneous sub-exponential noise.
result Explicit formulas for the distribution of estimated matrix entries under Poisson and Binary noise.
GHNet improves graph learning by balancing homogeneity and heterogeneity.
problem Over-smoothing in GCN leads to similar node representations.
method GHNet uses gating units to balance homogeneity and heterogeneity in feature propagation.
result GHNet achieves larger receptive fields without over-smoothing.
Gliomas are the most common primary brain malignancies, with different degrees of aggressiveness, variable prognosis and various heterogeneous histologic sub-regions, i.e., peritumoral edematous/invaded tissue, necrotic core, active and non-enhancing core. This intrinsic heterogeneity is also portrayed in their radio-p…
Publish a core-set of data to protect against adversarial use.
problem Protecting datasets from adversarial use.
method Construct a fair core-set for linear and neural models.
result Core-sets improve primary task performance while hindering unwanted tasks.
FedSARSA converges with heterogeneous agents, achieving linear speed-up.
problem Convergence analysis of Federated SARSA with heterogeneous agents.
method Linear function approximation, local training, multi-step error expansion.
result FedSARSA achieves linear speed-up with respect to the number of agents.
Unified MTL framework for heterogeneous data integrates shared and task-specific encoders.
problem Efficiently sharing information across multiple tasks with heterogeneous data.
method Dual-encoder framework with task-shared and task-specific encoders.
result Unified algorithm alternates learning task-specific and shared encoders and coefficients.