Develops neural network for directed hypergraphs for node classification.
problem Irregular data structure, particularly directed graphs.
method Directed hypergraph neural network and semi-supervised learning method.
result Novel directed hypergraph neural network achieves highest accuracies on node classification tasks.
Paper defines a new dimension to measure self-directed learning complexity.
problem Understanding self-directed learning complexity in online learning theory.
method Developed a dimension SDdim to characterize self-directed learning mistake-bound. result Calculated SDdim for various concept classes and demonstrated learnability gaps. Local causal structure learning aims to discover and distinguish direct causes (parents) and direct effects (children) of a variable of interest from data. While emerging successes have been made, existing methods need to search a large space to distinguish direct causes from direct effects of a target variable \emph{T…
FastMap-D embeds directed graphs using potential fields.
problem Embedding directed graphs in Euclidean space.
method Generalization of FastMap to handle directed graphs using a potential field and machine learning.
result FastMap-D outperforms other approaches in embedding directed graphs.
Proposes a novel approach using vector cross product to preserve directional edges in directed graphs.
problem Preserving directional edges in directed graphs for tasks like link prediction and node recommendation.
method Integrates the non-commutative property of vector cross product into a Siamese neural network to learn N-dimensional embeddings.
result Low-dimensional embeddings effectively preserve directional properties and outperform state-of-the-art methods.
Stochastic Gradient Descent shows directional bias with moderate learning rates, impacting optimization outcomes.
problem Understanding the bias of SGD with moderate learning rates in practical scenarios.
method Analyzing SGD and GD on an overparameterized linear regression problem.
result SGD converges along large eigenvalue directions, GD along small ones, affecting early stopping outcomes.
The paper studies kernel smoothing and mean shift for directional data, deriving convergence rates and mode estimation.
problem Statistical and computational problems of kernel smoothing for directional data.
method Generalization of mean shift to directional data, derivation of convergence rates, and investigation of mode estimation.
result Statistical convergence rates of directional KDE and its derivatives, ascending property of directional mean shift, and mode estimation.
Detects adversarial directions to make reinforcement learning policies more robust.
problem Adversarial attacks exploit non-robust directions in reinforcement learning policies, leading to instability.
method Local quadratic approximation of deep neural policy loss to identify non-robust directions.
result Provides a theoretical basis for distinguishing safe from adversarial observations.
Minimalistic model captures head direction system properties.
problem Representing head direction system in a high-dimensional space.
method A minimalistic representation model of the rotation group U(1), including fully connected and convolutional versions.
result Emergence of Gaussian-like tuning profiles and 2D circle geometry in both model versions.
The use of imitation learning to learn a single policy for a complex task that has multiple modes or hierarchical structure can be challenging. In fact, previous work has shown that when the modes are known, learning separate policies for each mode or sub-task can greatly improve the performance of imitation learning. …
The paper addresses challenges in edge deep learning for IoT, proposing new directions.
problem Challenges in large-scale deep learning adoption for IoT devices.
method Unified view targeting three research directions: federated learning, data-independent deployment, and communication-aware inference.
result A network-centric approach is needed for edge intelligence.
Study uses deep learning to predict asset prices, finds complex target processes lead to meaningless predictions.
problem Complexity of successful price prediction models hinders understanding.
method Deep learning models for high-frequency price prediction, focusing on volatility and directional prediction.
result Inadequately defined target price process renders predictions meaningless.
Paper proposes DAG-DB for learning discrete DAGs via backpropagation.
problem Learning Directed Acyclic Graphs (DAGs) from data.
method DAG-DB uses Discrete Backpropagation with I-MLE and Straight-Through Estimation.
result DAG-DB learns DAGs effectively using probabilistic sampling and backpropagation.
Method discovers nonlinear relations from time series data.
problem Identifying directional relations from nonlinear interactions in time series.
method Minimum predictive information regularization method for deep learning.
result Substantially outperforms other methods for learning nonlinear relations.
Although stochastic gradient descent (SGD) is a driving force behind the recent success of deep learning, our understanding of its dynamics in a high-dimensional parameter space is limited. In recent years, some researchers have used the stochasticity of minibatch gradients, or the signal-to-noise ratio, to better char…
Machine learning models predict EUR/USD currency direction with 58.52% accuracy.
problem Predicting the directional movement of EUR/USD in the Foreign Exchange market.
method Comparative analysis of machine learning models, including decorrelated and non-decorrelated feature sets, and meta-estimators.
result 58.52% accuracy for one-day ahead forecasts.
Proposes new stochastic algorithms for multi-objective optimization.
problem Multi-objective optimization in machine learning problems.
method Direction-oriented multi-objective formulation and Stochastic Direction-oriented Multi-objective Gradient descent (SDMGrad).
result Stochastic algorithms converge to Pareto stationary points with improved complexities.
Paper verifies RNNs using automata learning and model checking.
problem Verifying the correctness of RNNs is challenging.
method Learn a deterministic finite automaton from RNN, use model checking for verification.
result Can discover and generalize counterexamples to faulty flows.
TSAM predicts directed temporal links using GCN and self-attention.
problem Predicting links in directed temporal networks.
method GCN, self-attention mechanism, autoencoder architecture, graph attentional layers, graph convolutional layers, graph recurrent unit layer.
result TSAM outperforms benchmarks on four realistic networks.
Autoencoders are a deep learning model for representation learning. When trained to minimize the distance between the data and its reconstruction, linear autoencoders (LAEs) learn the subspace spanned by the top principal directions but cannot learn the principal directions themselves. In this paper, we prove that $L_2…
A new method learns node embeddings for signed directed networks by capturing both first-order and high-order topologies.
problem Learning representative node embeddings for signed directed networks considering both first-order and high-order topologies.
method Proposes a decoupled variational embedding (DVE) method that leverages a specially designed auto-encoder structure to capture both first-order and high-order topologies.
result Extensive experiments on real-world datasets show the effectiveness of DVE in link sign prediction and node recommendation tasks.
Paper proposes methods to learn DAGs from partial orderings.
problem Learning DAGs from partial orderings is challenging.
method General estimation framework and efficient algorithms for low- and high-dimensional problems.
result Efficient estimation of DAGs from partial orderings is possible.
Efficient algorithm for self-directed learning of convex clusters on graphs.
problem Self-directed classification of nodes on graphs with convex clusters.
method Developed efficient algorithms for (geodesically) convex clusters on graphs.
result Polynomial runtime algorithm with 3(h(G)+1)4lnn mistakes for graphs with two convex clusters. Many currently deployed Reinforcement Learning agents work in an environment shared with humans, be them co-workers, users or clients. It is desirable that these agents adjust to people's preferences, learn faster thanks to their help, and act safely around them. We argue that most current approaches that learn from hu…
Novel Haar-Laplacian for directed graphs enhances spectral graph applications.
problem Lack of suitable Laplacian for directed graphs in spectral graph theory.
method Inspired by Haar-like transformation, introduces a Hermitian matrix preserving direction and weight.
result HaarNet outperforms in weight prediction and denoising on directed graphs.
Direct Feedback Alignment performs well on diverse deep learning tasks and architectures.
problem The limitations of backpropagation in parallelizing and scaling to modern deep learning tasks.
method Direct Feedback Alignment approach applied to neural view synthesis, recommender systems, geometric learning, and natural language processing.
result Direct Feedback Alignment successfully trains a wide range of state-of-the-art deep learning architectures with performance close to fine-tuned backpropagation.
Proposes a new neural head for asymmetric representation learning.
problem Asymmetric representation learning in directed relations.
method Role-aware neural convex divergence head.
result Role-aware projections improve directional accuracy over plain ICNN-Bregman heads.
New method prevents deep learning models from forgetting past tasks.
problem Catastrophic forgetting in continual learning.
method Direction-constrained optimization (DCO) with autoencoders.
result Model performance is improved without forgetting past tasks.
We propose a method to learn causal response representations through direct effect analysis.
problem Uncovering direct causal effects in complex, multivariate settings.
method Our method bridges conditional independence testing with causal representation learning, formulating an optimisation problem to maximise evidence against conditional independence.
result The largest eigenvalue distribution can be bounded by an F-distribution, providing testable conditional independence. Improved SSD for faster and more accurate goodness-of-fit tests and model learning.
problem Optimal slicing directions for SSD are computationally expensive and sub-optimal.
method Relaxed optimal slicing requirement, active sub-space construction, spectral decomposition.
result 14-80x speed-up in goodness-of-fit tests compared to gradient-based alternatives.
Study reveals how neural network architectures bias their learning based on feature directions.
problem Understanding how neural network architectures bias their learning based on feature directions.
method Defined neural anisotropy directions (NADs) to encapsulate the directional inductive bias of architectures and provided an efficient method to identify them.
result NADs characterize the features used by CNNs to discriminate between different classes for the CIFAR-10 dataset.
TQF models multivariate uncertainty by learning conditional quantiles.
problem Challenges in fully nonparametric estimation of multivariate conditional distributions.
method Tomographic Quantile Forests (TQF) learns conditional quantiles of directional projections.
result TQF reconstructs multivariate conditional distribution efficiently without convexity restrictions.
REGAIN learns optimal auxiliary directions for forecast reconciliation.
problem Forecast reconciliation from fixed systems; identifying useful auxiliary directions.
method REGAIN learns normalized auxiliary directions, forecasts induced series, and selects directions by loss reduction.
result Gain-selected auxiliary directions improve forecast quality, especially for residual uncertainty.
Study evaluates and compares traditional and causal machine learning methods for estimating direct price effects of environmental amenities.
problem Estimating direct price effects of environmental amenities in housing markets.
method Empirical Monte Carlo simulation to compare traditional regression and causal machine learning approaches.
result Causal Machine Learning (CML) methods, particularly causal forest DID, perform comparably to generalized DID in most scenarios.
Estimates causal effects using machine learning for binary treatment and mediator.
problem Estimating direct and indirect quantile treatment effects under selection-on-observables.
method Double/debiased machine learning estimators based on efficient score functions.
result Uniform consistency and asymptotic normality of effect estimators.
Unsupervised method discovers interpretable directions in GAN latent space.
problem Discovering interpretable directions in GAN latent space without supervision.
method Model-agnostic procedure to identify directions corresponding to semantic manipulations.
result Findings include directions for background removal and competitive saliency detection performance.
Machine learning predicts critical points for directed percolation models.
problem Determining critical points for directed percolation models.
method Supervised and unsupervised machine learning algorithms (CNN and DBSCAN) were used.
result Machine learning accurately predicts critical points for both models.
We identify direct causes of a target variable from observational data without full DAG identifiability.
problem Learning direct causes of a target variable from observational data.
method Developed algorithms under relaxed identifiability assumptions for one environment without interventions.
result Identifiable set of direct causes from observational data under specific assumptions.
Direct learning framework for integrating multi-source causal data.
problem Conditional average treatment effects inference from heterogeneous data.
method Direct learning framework, double robustness, causal information-aware weighting function.
result Effective causal data fusion in both homogeneous and heterogeneous scenarios.
Develops a new neural spike train decoding framework using topological data.
problem Decoding neural spike trains from head direction and grid cells.
method Combines simplicial complex discovery with deep learning to capture higher-order connectivity.
result Demonstrates effectiveness on head direction and trajectory prediction datasets.
Direct and indirect RL methods classified and compared.
problem Classifying RL methods for sequential decision making.
method Direct RL solves optimal policy directly, indirect RL solves Bellman equation.
result Direct and indirect RL methods are equivalent and can be unified.
PyTorch Geometric Signed Directed fills the gap for GNNs on signed and directed graphs.
problem Lack of unified software packages for GNNs on signed and directed networks.
method Developed a software package with GNN models, synthetic and real-world data, and evaluation metrics.
result Demonstrates the effectiveness of the implemented methods through experiments.
Study compares ML algorithms for predicting stock market directional bias.
problem Predicting the direction of stock market movements.
method Examined and contrasted logistic regression, decision tree, random forest, and a deep neural network.
result All models consistently reach above 50% in directional bias forecasting.
Summarizing large-scaled directed graphs into small-scale representations is a useful but less studied problem setting. Conventional clustering approaches, which based on "Min-Cut"-style criteria, compress both the vertices and edges of the graph into the communities, that lead to a loss of directed edge information. O…
Stochastic Gradient Descent (SGD) based training of neural networks with a large learning rate or a small batch-size typically ends in well-generalizing, flat regions of the weight space, as indicated by small eigenvalues of the Hessian of the training loss. However, the curvature along the SGD trajectory is poorly und…
This work improves structured prediction by learning the balance between signal and random noise.
problem Structured prediction with random perturbations.
method Learning the variance of randomized structured predictors to balance signal and noise.
result Learning the balance improves structured prediction effectiveness.
Spectral clustering for directed graphs using likelihood estimation.
problem Clustering directed graphs with edge directions.
method Maximum likelihood estimation on stochastic block models.
result Significant performance gains over existing methods.
A novel approach learns goal-conditioned policies for locomotion using batch RL.
problem Training goal-conditioned policies for rotation invariant locomotion.
method Data augmentation and Siamese framework for invariance.
result Our approach outperforms existing RL algorithms on 3D locomotion agents.