We improve learning sub-tasks in hierarchical reinforcement learning using hyperbolic embeddings.
problem Learning meaningful sub-tasks in hierarchical reinforcement learning remains challenging.
method Combining routing in computer networks and graph-based skill discovery, we use hyperbolic embeddings to define sub-goals.
result Hyperbolic embeddings enforce a global topology on states, enabling the learning of meaningful sub-tasks.
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 improves ESG taxonomy and classifies sentences as sustainable or unsustainable.
problem Improving ESG taxonomy and classifying sentences based on ESG factors.
method For ESG taxonomy, used Sentence-BERT models. For sentence classification, combined RoBERTa with a multi-layer perceptron.
result Significant performance improvement and high accuracy in classifying sentences.
This paper describes the participation of Amobee in the shared sentiment analysis task at SemEval 2018. We participated in all the English sub-tasks and the Spanish valence tasks. Our system consists of three parts: training task-specific word embeddings, training a model consisting of gated-recurrent-units (GRU) with …
OCEAN infers online task identities from context variables.
problem Online task inference for compositional tasks with context adaptation.
method Variational inference framework OCEAN models global and local context variables in a joint latent space.
result OCEAN provides more effective task inference with sequential context adaptation.
New methods improve neural directed link prediction across all sub-tasks.
problem Directed link prediction requires handling edge directionality and bidirectionality, not just edge existence.
method Proposes three strategies: Multi-Class Framework, Multi-Objective, and Scalarized approaches.
result Improved performance across all three sub-tasks of directed link prediction.
This paper describes the Amobee sentiment analysis system, adapted to compete in SemEval 2017 task 4. The system consists of two parts: a supervised training of RNN models based on a Twitter sentiment treebank, and the use of feedforward NN, Naive Bayes and logistic regression classifiers to produce predictions for the…
Many problems in sequential decision making and stochastic control often have natural multiscale structure: sub-tasks are assembled together to accomplish complex goals. Systematically inferring and leveraging hierarchical structure, particularly beyond a single level of abstraction, has remained a longstanding challen…
MaMiC proposes a dual curriculum for robot manipulation tasks with sparse rewards.
problem Overcoming exploratory constraints in robot manipulation tasks with sparse rewards.
method Includes a macro curriculum scheme and a micro curriculum scheme to guide learning.
result Combining macro and micro curriculum strategies improves performance in robot manipulation tasks.
We introduce local expectation gradients which is a general purpose stochastic variational inference algorithm for constructing stochastic gradients through sampling from the variational distribution. This algorithm divides the problem of estimating the stochastic gradients over multiple variational parameters into sma…
Many advanced Learning from Demonstration (LfD) methods consider the decomposition of complex, real-world tasks into simpler sub-tasks. By reusing the corresponding sub-policies within and between tasks, they provide training data for each policy from different high-level tasks and compose them to perform novel ones. E…
Variational inference improves hierarchical imitation learning of control programs.
problem Learning structured control policies from demonstrations.
method Variational inference for discovering hierarchical structure in observation-action traces.
result Variational inference leads to more efficient and generalized control policies.
FinCausal 2020 task detects financial document causality.
problem Detect causal relationships in financial documents.
method Binary classification and relation extraction tasks.
result 16 teams participated, 13 submitted system descriptions.
A new method for solving complex sequential decision-making problems by decomposing them into multiple levels.
problem Sequential decision-making with natural multi-level structure.
method Multi-level meta-reinforcement learning with skill-based curriculum.
result Efficiently reduces stochasticity and policy search space, leading to fewer iterations and computations.
Learning the minimum/maximum mean among a finite set of distributions is a fundamental sub-task in planning, game tree search and reinforcement learning. We formalize this learning task as the problem of sequentially testing how the minimum mean among a finite set of distributions compares to a given threshold. We deve…
Differentiable causal discovery methods perform robustly under model violations.
problem Causal discovery algorithms struggle with real-world data due to unverifiable causal assumptions.
method Benchmarked differentiable causal discovery methods under eight model assumption violations.
result Differentiable causal discovery methods exhibit robust performance under Structural Hamming Distance and Structural Intervention Distance metrics.
New framework uses background knowledge to speed up causal discovery.
problem Scalable causal discovery for large datasets.
method Utilizes background knowledge during causal discovery process.
result Background knowledge reduces computational requirements and improves structure quality.
New method prevents invalid inference after causal discovery.
problem Invalid inference after causal discovery.
method Developed tools for valid post-causal-discovery inference.
result Our method provides reliable coverage while achieving more accurate causal discovery.
LDP speeds up causal discovery by partitioning, improving VAS recall and runtime.
problem Hard causal discovery in nonparametric settings with exponential complexity.
method Local Discovery by Partitioning (LDP) for causal inference around exposure-outcome pairs.
result LDP yields less biased and more precise estimates than baseline methods.
Interactive learning framework for various settings.
problem Various interactive learning settings.
method Adapted active learning algorithm for interactive structure discovery.
result Noise-tolerant algorithm with favorable query complexity.
Proposes LLM-DCD for improved causal discovery from data.
problem Challenges in discovering causal relationships from observational data.
method Uses LLM to initialize DCD optimization, incorporating priors.
result Higher accuracy on benchmark datasets compared to state-of-the-art.
Probabilistic grammars improve equation discovery from data.
problem Discovering scientific laws from data using equations.
method Proposed probabilistic context-free grammars to encode soft constraints and a Monte-Carlo algorithm.
result Probabilistic grammars lead to more efficient equation discovery.
Causal discovery improves fMRI analysis, but faces challenges.
problem Challenges in applying causal discovery to fMRI data.
method Identifying and addressing nine challenges in fMRI causal discovery.
result Current methods for fMRI causal discovery need improvement.
New methods for Markov Blanket discovery using MML outperform existing approaches.
problem Causal discovery from large datasets.
method Developed three new methods of Markov Blanket discovery using Minimum Message Length.
result Our best MML method is consistently competitive and has advantageous features.
L2D-CD learns to defer expert recommendations in causal discovery.
problem Combining expert knowledge with data-driven results in causal discovery when expert recommendations may contradict data.
method Adapting learning-to-defer algorithms for pairwise causal discovery, L2D-CD learns a deferral function to select between expert recommendations and data-driven methods.
result L2D-CD outperforms both causal discovery methods and the expert used in isolation, identifying domains where the expert's performance is strong or weak.
Review of automation's role in chemical discovery, emphasizing future challenges.
problem Improving automation's contribution to chemical discovery.
method Analysis of exemplary studies and open research directions.
result Future autonomous systems need improvement in data handling, model building, and experiment automation.
REDS improves scenario discovery from few simulations, reducing costs by 50-75%.
problem Discovering scenarios in data spaces resulting from simulations with limited computational resources.
method Uses an intermediate machine learning model to label data for subgroup discovery methods.
result Reduces the number of simulations required by 50-75% on average.
New method controls false discoveries in financial asset pricing.
problem Controlling false discoveries in time series with unknown correlations.
method Double bootstrapping method to control false discovery rate.
result Superior statistical power and controlled false discovery rate.
Interpretable ML helps discover insights from big data.
problem Validating data-driven discoveries from complex datasets.
method Statistical and machine learning techniques for interpretable models.
result Challenges in validating data-driven discoveries remain.
Transformer model estimates keywords for better audio captioning.
problem Indeterminacy in word selection for audio events/scenes.
method Transformer-based model with keyword estimation.
result Achieved state-of-the-art performance in AAC.
KEEL improves causal discovery with fuzzy knowledge and complex data.
problem Challenges in causal discovery due to prior knowledge, domain inconsistencies, and small sample sizes.
method Weakly-supervised fuzzy knowledge and data co-driven causal discovery method (KEEL).
result KEEL outperforms state-of-the-art methods in accuracy, robustness, and computational efficiency.
Review of automation's role in chemical discoveries.
problem Improving autonomous discovery in chemistry.
method Classification of discovery types, assessment of autonomy, case studies.
result Rapid advancements in automation and machine learning are transforming experimentation and modeling.
Cluster-DAGs improve causal discovery with prior knowledge.
problem Finding cause-effect relationships from high-dimensional data.
method Cluster-DAGs as prior knowledge framework, modified constraint-based algorithms Cluster-PC and Cluster-FCI.
result Cluster-PC and Cluster-FCI outperform baselines without prior knowledge.
New algorithm tackles hidden confounders in causal discovery.
problem Hidden confounders make causal discovery difficult.
method LFOICA estimates mixing matrix directly without parametric assumptions.
result Computational efficiency makes causal discovery more feasible.
The paper examines how timing of observations affects causal discovery methods.
problem The sensitivity of causal discovery methods to mismatched observation timing.
method Empirical and theoretical analysis of classical and recent causal discovery methods.
result Causal discovery methods are sensitive to sampling rate and window length.
Paper shows intrinsic motivation boosts exploration efficiency in HRL.
problem Efficient exploration and subgoal discovery in model-free HRL.
method Unsupervised learning over agent's experiences for subgoal discovery.
result Intrinsic motivation learning improves exploration efficiency.
New algorithm improves materials discovery using max K-Armed Bandit.
problem Maximizing material breakthroughs in materials discovery.
method Proposed a search algorithm based on max K-Armed Bandit (MKB) for materials discovery.
result Stable performance in late search stages, outperforming other bandit algorithms.
This work integrates domain knowledge into A*-based causal discovery methods.
problem Efficiently incorporating domain knowledge into A*-based causal discovery methods.
method Integrates various types of domain knowledge into A*-based causal discovery methods, reducing the graph search space and improving computational gains.
result Small amounts of domain knowledge can dramatically speed up A*-based causal discovery and improve its performance and practicality.
Align-RUDDER improves reinforcement learning with few demonstrations by redistributing rewards.
problem Learning complex tasks with sparse and delayed rewards using few demonstrations.
method Align-RUDDER uses a profile model for reward redistribution based on multiple sequence alignment of demonstrations.
result Align-RUDDER outperforms competitors on complex tasks with few demonstrations.
New methods control false discoveries near the boundary in conformal novelty detection.
problem Over-optimistic assessments near the rejection threshold in conformal novelty detection.
method Support line (SL) correction and alternative procedures to control boundary false discovery rate (bFDR).
result New procedures control the boundary false discovery rate (bFDR) in the conformal setting.
Paper presents a new dataset for testing causal discovery methods in industrial systems.
problem Lack of real-world datasets for evaluating causal discovery methods on time series data.
method Develops a dataset from an industrial system and its known causal graph.
result Provides a benchmark for evaluating causal discovery methods in complex systems.
Simulates neuropathic pain to evaluate causal discovery algorithms.
problem Lack of benchmark datasets for evaluating causal discovery algorithms.
method Developed a neuropathic pain diagnosis simulator.
result Simulator produces data similar to real-world data.
Python library for causal discovery from observational data.
problem Revealing causal relations from observational data.
method Comprehensive collection of causal discovery methods in Python.
result Ease of use for non-specialists and modular building blocks for developers.
Python toolbox uncovers causal relationships from data.
problem Discovering causal relationships from observational data.
method End-to-end approach using algorithms from 'Bnlearn' and 'Pcalg', including pairwise causal discovery.
result Recovery of direct dependencies and causal relationships.
The paper establishes bounds for score-matching in causal discovery and generative modeling.
problem Estimating causal relationships from data.
method Training a deep neural network to estimate the score function and applying it to causal discovery.
result Bounds on the error rate of causal discovery methods using score-matching.
The aim of process discovery, originating from the area of process mining, is to discover a process model based on business process execution data. A majority of process discovery techniques relies on an event log as an input. An event log is a static source of historical data capturing the execution of a business proc…
LCD improves causal discovery in high-dimensional gene data.
problem Predicting causal effects in large-scale gene expression data.
method Local Causal Discovery (LCD) with practical estimators, ICP algorithm inspiration, preselection method, and statistical tests.
result LCD estimator closely matches ICP's accuracy but is simpler and faster.
Visualizes deep generative models for drug design.
problem Limited visualization tools for deep generative models in drug discovery.
method Proposes a visualization framework for deep graph generative models.
result Interactive visualization and molecular optimization tools.