In this thesis, we study the problem of feature learning on heterogeneous knowledge graphs. These features can be used to perform tasks such as link prediction, classification and clustering on graphs. Knowledge graphs provide rich semantics encoded in the edge and node types. Meta-paths consist of these types and abst…
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,742 papers · 148 categories
Trend · papers per month
48 results for “meta paths”
Meta-graph is currently the most powerful tool for similarity search on heterogeneous information networks,where a meta-graph is a composition of meta-paths that captures the complex structural information. However, current relevance computing based on meta-graph only considers the complex structural information, but i…
Collective classification has been intensively studied due to its impact in many important applications, such as web mining, bioinformatics and citation analysis. Collective classification approaches exploit the dependencies of a group of linked objects whose class labels are correlated and need to be predicted simulta…
Proposes a method to improve graph neural networks on heterogeneous graphs using meta-paths.
problem Improving graph neural networks on heterogeneous graphs with auxiliary tasks.
method Self-supervised auxiliary learning with meta-paths for heterogeneous graphs.
result Consistently improves link prediction and node classification on heterogeneous graphs.
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.
ie-HGCN addresses HIN challenges by efficiently learning node representations.
problem Lack of flexibility in exploring meta-paths and high computational complexity in HIN GCN methods.
method Hierarchical aggregation architecture that automatically extracts useful meta-paths and reduces computational cost.
result ie-HGCN outperforms state-of-the-art methods on real network datasets.
HeteSpaceyWalk: A Heterogeneous Spacey Random Walk for Heterogeneous Information Network Embeddingcs.LG
Heterogeneous information network (HIN) embedding has gained increasing interests recently. However, the current way of random-walk based HIN embedding methods have paid few attention to the higher-order Markov chain nature of meta-path guided random walks, especially to the stationarity issue. In this paper, we system…
Paper proposes a method to evaluate SME credit risk using meta paths.
problem Evaluate credit risk of small and medium-sized enterprises with limited data.
method Exploits the representative power of information networks and meta paths to infer SME financial status.
result Meta path feature effectively identifies SMEs with credit risks.
CARML uses meta-learning to avoid obstacles in 2D vehicle navigation.
problem Collision avoidance in 2D vehicle navigation.
method Model-Agnostic Meta-Learning for multi-objective reinforcement learning.
result CARML outperforms a baseline TD3 solution in obstacle avoidance.
User-based attribute information, such as age and gender, is usually considered as user privacy information. It is difficult for enterprises to obtain user-based privacy attribute information. However, user-based privacy attribute information has a wide range of applications in personalized services, user behavior anal…
We introduce a new function-preserving transformation for efficient neural architecture search. This network transformation allows reusing previously trained networks and existing successful architectures that improves sample efficiency. We aim to address the limitation of current network transformation operations that…
A new method for portfolio allocation in continuous-time markets.
problem Path-dependent portfolio allocation in continuous-time markets.
method Path-by-path framework, self-financing concept, partial differential equation, continuous-time algorithms.
result General explicit solution for wealth evolution in generic markets.
Develops exact and invariant study-based decompositions for network meta-analysis.
problem Lack of exact contribution decompositions in network meta-analysis.
method Contrast-space projection formulation of NMA, study-based definition of direct and indirect evidence.
result Exact covariance-aware decompositions of NMA estimator into direct and indirect contributions.
In this paper, we focus on graph representation learning of heterogeneous information network (HIN), in which various types of vertices are connected by various types of relations. Most of the existing methods conducted on HIN revise homogeneous graph embedding models via meta-paths to learn low-dimensional vector spac…
Heterogeneous Information Network based Default Analysis on Banking Micro and Small Enterprise Usersq-fin.RM
Paper proposes HIDAM model to improve MSE default risk assessment using heterogeneous information networks.
problem Default risk assessment for MSEs due to lack of credit information and diverse financial activities.
method HIDAM model incorporating heterogeneous information networks with multi-typed nodes and links, extracting interactive information through meta-paths, and using a hierarchical attention mechanism.
result HIDAM model outperforms state-of-the-art competitors on real-world banking data.
There are many real-world knowledge based networked systems with multi-type interacting entities that can be regarded as heterogeneous networks including human connections and biological evolutions. One of the main issues in such networks is to predict information diffusion such as shape, growth and size of social even…
Proposes a new method to optimize graph neural network architectures on heterogeneous information networks.
problem Weaknesses in instability and inflexibility of existing graph neural architecture search methods.
method Partial Message Meta Multigraph search (PMMM) using a differentiable framework to search for a meaningful meta multigraph.
result Significantly more stable and effective than state-of-the-art heterogeneous GNNs.
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…
This paper presents a normalization mechanism called Instance-Level Meta Normalization (ILM~Norm) to address a learning-to-normalize problem. ILM~Norm learns to predict the normalization parameters via both the feature feed-forward and the gradient back-propagation paths. ILM~Norm provides a meta normalization mechanis…
Balanced Direction from Multifarious Choices: Arithmetic Meta-Learning for Domain Generalizationcs.LG
New meta-learning method improves domain generalization by balancing parameters closer to domain centroids.
problem Improving domain generalization by reducing overfitting to specific domains.
method Arithmetic meta-learning with arithmetic-weighted gradients to balance parameters closer to domain centroids.
result Experimental validation of improved domain generalization performance.
A new system recommends specific knowledge concepts in MOOCs based on student interests.
problem MOOCs recommend courses but ignore specific knowledge concepts interests.
method End-to-end graph neural network (ACKRec) that combines content and context information.
result ACKRec effectively recommends knowledge concepts to MOOC students.
Adversarial example generation becomes a viable method for evaluating the robustness of a machine learning model. In this paper, we consider hard-label black-box attacks (a.k.a. decision-based attacks), which is a challenging setting that generates adversarial examples based on only a series of black-box hard-label que…
A core capability of intelligent systems is the ability to quickly learn new tasks by drawing on prior experience. Gradient (or optimization) based meta-learning has recently emerged as an effective approach for few-shot learning. In this formulation, meta-parameters are learned in the outer loop, while task-specific m…
Graph neural networks (GNNs) have been widely used in representation learning on graphs and achieved state-of-the-art performance in tasks such as node classification and link prediction. However, most existing GNNs are designed to learn node representations on the fixed and homogeneous graphs. The limitations especial…
New Hessian-free method improves bilevel optimization for meta-learning.
problem Efficiently solving bilevel optimization problems with limited second-order information.
method Proposes a new Hessian-free method that approximates the response Jacobian matrix via optimization path differences.
result Demonstrates superior performance on meta-learning tasks compared to baseline methods.
This dissertation automates deep learning pipelines and uses meta-learning for better model selection and data augmentation.
problem Challenges in selecting and fine-tuning deep learning pipelines for new datasets.
method Meta-learning for DL pipeline selection and data augmentation, using synthetic data.
result Meta-learned approaches outperform traditional methods in automated DL pipeline selection and data augmentation.
OptFormer learns universal HPO from diverse datasets.
problem Learning HPO from experiments with different hyperparameters.
method Text-based Transformer framework for joint policy and function prediction.
result OptFormer can imitate multiple HPO algorithms and improve predictions.
In complex transfer learning scenarios new tasks might not be tightly linked to previous tasks. Approaches that transfer information contained only in the final parameters of a source model will therefore struggle. Instead, transfer learning at a higher level of abstraction is needed. We propose Leap, a framework that …
We propose a meta path planning algorithm named \emph{Neural Exploration-Exploitation Trees~(NEXT)} for learning from prior experience for solving new path planning problems in high dimensional continuous state and action spaces. Compared to more classical sampling-based methods like RRT, our approach achieves much bet…
Events are happening in real-world and real-time, which can be planned and organized occasions involving multiple people and objects. Social media platforms publish a lot of text messages containing public events with comprehensive topics. However, mining social events is challenging due to the heterogeneous event elem…
Develops HMRL for sparse reward RL problems, improving meta policy efficiency and transferability.
problem Difficulty in learning meta policies for sparse reward RL problems.
method Hyper-Meta RL framework with cross-environment meta state embedding and shaped meta reward.
result Improves meta policy generalization and efficiency for sparse reward RL problems.
A new meta-meta classification method tackles few-shot learning tasks.
problem Learning with limited data in small-data settings.
method Designing an ensemble of learners for a large set of problems, then learning how to combine them for a new problem.
result Meta-meta classification outperforms traditional meta-learning and ensembling approaches in one-shot learning tasks.
New method for incremental meta-learning reduces forgetting and improves performance.
problem Incremental meta-learning for few-shot classification tasks.
method Indirect Discriminant Alignment (IDA) with incremental updates.
result Incremental learning reduces forgetting and improves performance.
Meta-learning adapts models for unseen tasks across AI, robotics, and NLP.
problem Adapting models to unseen tasks efficiently and accurately.
method Black-box, metric-based, layered, and Bayesian approaches.
result Meta-learning enhances model generalization and adaptation to unseen tasks.
Gradient-based meta-RL fails with incorrect task distributions, leading to instability and poor performance.
problem Gradient-based meta-RL's sensitivity to task distributions causes instability and poor performance.
method Proposes meta Active Domain Randomization (meta-ADR) to learn task distributions for gradient-based meta-RL.
result Meta-ADR improves stability and generalization of MAML on simulated locomotion and navigation tasks.
Meta-learning overfits both model and base learner; meta-augmentation helps.
problem Meta-learning overfits model and base learner.
method Use an information-theoretic framework to describe and demonstrate meta-augmentation.
result Meta-augmentation produces large complementary benefits to meta-regularization.
M3PO improves model-based meta-RL with theoretical guarantees.
problem Improving sample efficiency in multi-task RL with theoretical guarantees.
method Extending Janner et al. (2019) theorems, proposing M3PO with performance guarantees.
result M3PO outperforms existing methods in continuous-control benchmarks.
Meta learning can adapt fast but is vulnerable to adversarial attacks.
problem Vulnerability of meta learning to adversarial attacks.
method Formal definition of adversarial attacks unique to meta learning, proposing an attacking algorithm.
result Meta learning is vulnerable to adversarial attacks.
Paper tackles offline meta-reinforcement learning with a new algorithm.
problem Performing reinforcement learning on limited data from a new task.
method Meta-Actor Critic with Advantage Weighting (MACAW) algorithm.
result Achieves notable gains over prior methods on offline meta-RL benchmarks.
Bayesian MAML outperforms MAML in meta learning tasks with theoretical guarantees.
problem Theoretical understanding of Bayesian MAML's superiority over MAML.
method Comparison of meta test risks between Bayesian MAML and MAML in meta linear regression.
result Bayesian MAML has provably lower meta test risks than MAML in both distribution agnostic and linear centroid cases.
Modified Meta-TS for linear contextual bandits reduces regret.
problem Optimizing decision-making in dynamic environments with context vectors.
method Meta-TSLB algorithm for linear contextual bandits, analyzing Bayes regret.
result Derives an bound on Bayes regret.
Meta-learning algorithm improves AI efficiency by teaching itself.
problem Overcoming meta-optimization challenges in AI learning.
method Bootstraps a target from the meta-learner and optimizes the meta-learner by minimizing distance under a chosen metric.
result Achieves state-of-the-art performance on Atari ALE benchmark and demonstrates efficiency gains in multi-task learning.
Local nonparametric meta-learning improves meta-generalization across tasks.
problem Meta-learning struggles with global inductive biases and out-of-distribution tasks.
method Proposes a local, nonparametric meta-learning algorithm using meta-trained local learning rules.
result Improved meta-generalization and state-of-the-art results in robotics benchmarks.
Credit assignment in Meta-reinforcement learning (Meta-RL) is still poorly understood. Existing methods either neglect credit assignment to pre-adaptation behavior or implement it naively. This leads to poor sample-efficiency during meta-training as well as ineffective task identification strategies. This paper provide…
Self-referential meta learning avoids explicit optimization by modifying itself.
problem Dependency on human engineering in meta learning algorithms.
method Investigates self-referential meta learning systems that modify themselves without explicit optimization.
result Self-referential neural networks can improve their own modifications without explicit optimization.
F-PACOH improves meta-learners' reliability in uncertain regions.
problem Overconfident uncertainty estimates in meta-learning.
method Meta-learning priors as stochastic processes in function space, directly steering predictions towards high epistemic uncertainty.
result Significantly outperforms other meta-learners in Bayesian Optimization.
Meta-learning, or learning to learn, is a machine learning approach that utilizes prior learning experiences to expedite the learning process on unseen tasks. As a data-driven approach, meta-learning requires meta-features that represent the primary learning tasks or datasets, and are estimated traditonally as engineer…
Conditional meta-learning improves meta-learning performance in diverse task environments.
problem Meta-learning struggles with tasks that have heterogeneous complexity.
method Conditional meta-learning infers a task-specific meta-parameter vector.
result Conditional meta-learning outperforms standard meta-learning in diverse task environments.