Framework simplifies vision-based control and goal discovery.
problem Learning proportional control from visual data.
method Introduces NewtonianVAE for proportional control and goal discovery.
result Dramatic simplification and acceleration of vision-based controllers.
We propose a novel framework to identify sub-goals useful for exploration in sequential decision making tasks under partial observability. We utilize the variational intrinsic control framework (Gregor et.al., 2016) which maximizes empowerment -- the ability to reliably reach a diverse set of states and show how to ide…
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.
ASD algorithm maximizes model estimates by adaptively labeling points.
problem Maximizing model estimates through adaptive labeling of points in a sequential decision-making problem.
method Formulated a general information-directed sampling (IDS) algorithm with theoretical guarantees for linear, graph, and low-rank models.
result IDS algorithm outperforms in both simulation and real-data experiments for discovering chemical reaction conditions.
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.
Study maps interdependence of SDGs, finds complex, dynamic linkages.
problem Identify which SDGs promote progress and how quickly.
method Used a balanced panel of 114 countries from 2000 to 2024, applying two estimators to recover directed interaction network and measure dynamic linkages.
result 84 goal linkages survive false-discovery control, showing both synergies and trade-offs, with no single goal acting as a universal accelerator.
This work tackles causal graph discovery with stochastic interventions to minimize the number of interventions.
problem Discovering the true causal graph from observational data with limited interventions.
method Proposes a stochastic intervention model and studies verification and search problems with approximation algorithms.
result Provides approximation algorithms with competitive ratios for verification and search problems.
Paper proposes knockoff-based methods to simplify deep neural networks by controlling false discovery rates.
problem High-dimensional deep neural networks with many irrelevant parameters and inputs.
method Knockoff methods combined with regularized neural networks for variable screening.
result Proposed algorithms show satisfactory performance in controlling false discovery rates.
Neural Shadow-Mapping uncovers causal links in dynamic systems.
problem Discovering causal structures in dynamic systems with mirage correlations.
method Neural network based method embedding high-dimensional data into a shadow representation for causal link estimation.
result Demonstrates performance in discovering causal links from video-representations of dynamic systems.
This paper introduces a new system for discovering patterns in morphogenetic systems using modular architecture and unsupervised learning.
problem Discovering novel patterns in morphogenetic systems is challenging and often relies on manual tuning.
method Introduces a hierarchical, modular architecture for unsupervised learning of diverse representations combined with goal exploration algorithms.
result The new system efficiently adapts diversity search towards user preferences with minimal feedback.
Automated process discovery is a class of process mining methods that allow analysts to extract business process models from event logs. Traditional process discovery methods extract process models from a snapshot of an event log stored in its entirety. In some scenarios, however, events keep coming with a high arrival…
Private online FDR control for adaptive testing under differential privacy.
problem Controlling false discoveries in adaptive multiple hypothesis testing with privacy constraints.
method Private online algorithms based on non-private results, ensuring privacy and statistical performance.
result Strong guarantees for privacy and statistical performance in FDR and power.
DESMILES uses deep learning to improve drug discovery by optimizing molecule properties.
problem Improving the efficiency and accuracy of drug discovery through better molecular design.
method DESMILES is a deep neural network model that optimizes molecular properties for drug discovery.
result DESMILES achieved a 77% lower failure rate in modifying molecules to inhibit the dopamine receptor D2 compared to state-of-the-art models.
In many complex dynamical systems, artificial or natural, one can observe self-organization of patterns emerging from local rules. Cellular automata, like the Game of Life (GOL), have been widely used as abstract models enabling the study of various aspects of self-organization and morphogenesis, such as the emergence …
The automatic and efficient discovery of skills, without supervision, for long-living autonomous agents, remains a challenge of Artificial Intelligence. Intrinsically Motivated Goal Exploration Processes give learning agents a human-inspired mechanism to sequentially select goals to achieve. This approach gives a new p…
New RL environments help AI learn causal relationships from visual data.
problem Learning causal relationships from visual data for AI agents.
method Designing benchmark RL environments and evaluating representation learning algorithms.
result Explicitly incorporating structure and modularity improves causal induction in model-based RL.
We release the largest public ECG dataset of continuous raw signals for representation learning containing 11 thousand patients and 2 billion labelled beats. Our goal is to enable semi-supervised ECG models to be made as well as to discover unknown subtypes of arrhythmia and anomalous ECG signal events. To this end, we…
Learning to solve complex goal-oriented tasks with sparse terminal-only rewards often requires an enormous number of samples. In such cases, using a set of expert trajectories could help to learn faster. However, Imitation Learning (IL) via supervised pre-training with these trajectories may not perform as well and gen…
We address the problem of latent truth discovery, LTD for short, where the goal is to discover the underlying true values of entity attributes in the presence of noisy, conflicting or incomplete information. Despite a multitude of algorithms to address the LTD problem that can be found in literature, only little is kno…
Estimates target GGM using auxiliary studies with false discovery rate control.
problem Estimating high-dimensional GGMs from related studies.
method Transfer learning with Trans-CLIME and debiased Trans-CLIME estimators.
result Debiased Trans-CLIME estimator provides element-wise asymptotic normality and false discovery rate control.
New method uncovers hidden causal connections in multivariate point process networks.
problem Unobserved hidden variables confound causal discovery in high-dimensional point process networks.
method Proposes a deconfounding procedure to estimate causal interactions among observed nodes with unknown unobserved processes.
result The method accurately identifies causal interactions among observed processes, even with hidden variables.
This thesis relaxes assumptions for causal discovery, making methods applicable to more complex systems.
problem Learning causal structures from observational data with latent variables.
method Alternative definition of k-Triangle Faithfulness for non-Gaussian distributions and uniform consistency proof.
result Uniform consistency of causal discovery algorithm under modified faithfulness assumption.
In recent years, data-driven methods have been developed to learn dynamical systems and partial differential equations (PDE). The goal of such work is discovering unknown physics and the corresponding equations. However, prior to achieving this goal, major challenges remain to be resolved, including learning PDE under …
This paper formalizes a latent variable inference problem we call {\em supervised pattern discovery}, the goal of which is to find sets of observations that belong to a single ``pattern.'' We discuss two versions of the problem and prove uniform risk bounds for both. In the first version, collections of patterns can be…
This work demonstrates the execution of a novel process model for knowledge discovery and data mining for metabolomics (MeKDDaM). It aims to illustrate MeKDDaM process model applicability using four different real-world applications and to highlight its strengths and unique features. The demonstrated applications provi…
Hierarchical reinforcement learning deals with the problem of breaking down large tasks into meaningful sub-tasks. Autonomous discovery of these sub-tasks has remained a challenging problem. We propose a novel method of learning sub-tasks by combining paradigms of routing in computer networks and graph based skill disc…
ACS is an interactive framework for model-free selection with guaranteed error control.
problem Model-free selection with rigorous error control.
method Adaptive conformal selection with human-in-the-loop data exploration and new information incorporation.
result ACS provides concrete selection algorithms for various goals, including model update/selection, diversified selection, and incorporating new data.
Conventionally, model-based reinforcement learning (MBRL) aims to learn a global model for the dynamics of the environment. A good model can potentially enable planning algorithms to generate a large variety of behaviors and solve diverse tasks. However, learning an accurate model for complex dynamical systems is diffi…
Unified framework controls false discovery rate in bandit multiple testing.
problem Designing adaptive algorithms to identify true discoveries in multiple hypothesis testing.
method Unified modular framework using e-processes for FDR control in arbitrary settings.
result Unified framework ensures FDR control for dependent and simultaneous arm queries.
GO-CBED optimizes experiments for specific causal queries, improving efficiency.
problem Efficiently infer causal relationships with limited resources.
method Goal-oriented Bayesian framework that maximizes expected information gain on user-specified causal quantities.
result GO-CBED outperforms existing methods in various causal tasks, especially with limited budgets.
Machine learning methods have been remarkably successful for a wide range of application areas in the extraction of essential information from data. An exciting and relatively recent development is the uptake of machine learning in the natural sciences, where the major goal is to obtain novel scientific insights and di…
The paper discovers a hidden component in data using an autoencoder with a discriminator.
problem Discovering a single independent latent variable in data.
method An autoencoder with a discriminator is used to recover the hidden component.
result The approach can recover the hidden component up to entropy-preserving transformations.
Our goal is to estimate causal interactions in multivariate time series. Using vector autoregressive (VAR) models, these can be defined based on non-vanishing coefficients belonging to respective time-lagged instances. As in most cases a parsimonious causality structure is assumed, a promising approach to causal discov…
New method learns time-varying home field advantage in football.
problem Discovering causal factors behind home field advantage in sports.
method DYNAMO: a novel causal discovery method for non-stationary processes.
result Time-varying home field advantages influenced by referee bias.
We discover subgroups for Cox model survival analysis, improving model accuracy.
problem Finding interpretable subsets of data where Cox model is highly accurate.
method Developed new metrics (EPE, CRS) and algorithms to solve subgroup discovery problem.
result Our methods improve model fit and recover known nonlinearities in data.
Survey discusses new ideas in geometric group theory and their applications.
problem Understanding geodesic metric spaces and their equivariant wall structures.
method Introduces and highlights the impact of injective metric spaces and cubical approximation theorem.
result Rich equivariant wall structures in various geodesic metric spaces.
The paper introduces localized conformal p-values for conditional testing problems.
problem Addressing conditional testing problems in statistics.
method Localized conformal p-values defined by inverting prediction intervals.
result Proposes procedures for conditional outlier detection and label screening with FDR and FWER control.
Reinforcement learning requires manual specification of a reward function to learn a task. While in principle this reward function only needs to specify the task goal, in practice reinforcement learning can be very time-consuming or even infeasible unless the reward function is shaped so as to provide a smooth gradient…
We apply multiple testing procedures to the validation of estimated default probabilities in credit rating systems. The goal is to identify rating classes for which the probability of default is estimated inaccurately, while still maintaining a predefined level of committing type I errors as measured by the familywise …
SANE improves exploration of noisy, multimodal functions by finding multiple optima.
problem Finding multiple optima in noisy, non-differentiable functions.
method Strategic Autonomous Non-Smooth Exploration (SANE) with a cost-driven acquisition function and human knowledge gate.
result SANE outperforms classical Bayesian optimization in discovering multiple optima.
Model discovers causal relationships from video data of physical systems.
problem Discover structural dependencies and causal interactions in physical systems from video data.
method End-to-end model with perception, inference, and dynamics modules; handles unknown interventions.
result Model correctly identifies causal interactions and makes long-term predictions.
Agent learns diverse hierarchical structures in unknown environments.
problem Autonomous discovery and learning of diverse structures in unknown changing environments.
method Progressive construction of a Hierarchy of Observation Latent Models for Exploration Stratification (HOLMES).
result Agent can learn and reuse representations to progressively explore and discover diverse structures.
Method minimizes total cost of classification by acquiring covariates efficiently.
problem Minimizing total cost of classification in applications with covariate acquisition costs.
method Formalizes optimization goal using Bayes risk, introduces assumptions for computable solution.
result Proposed method achieves lowest total costs compared to previous methods on medical datasets.
Generative model learns to create molecules with multiple properties using interpretable substructures.
problem Creating molecules with multiple chemical properties is challenging.
method Compose molecules from substructures identified as responsible for each property, using graph generative models.
result Significant improvements in accuracy, diversity, and novelty of generated compounds over state-of-the-art baselines.
This paper applies secure multi-party computation to K-means clustering to protect private data.
problem Privacy-preserving K-means clustering for distributed private data.
method Secure multi-party computation (MPC) techniques to protect private data during K-means clustering.
result Privacy-preserving K-means clustering is feasible and effective for both horizontal and vertical data distribution.
Automates research and development process by evaluating model capabilities.
problem Expanding experimental burden due to reading and verifying research directions.
method Proposes RD2Bench, a benchmark for evaluating data-centric automatic R&D.
result Demonstrates promising potential of LLMs in automating R&D process.
A new method calculates optimal decisions from classifier outputs, improving predictions in drug discovery.
problem Finding optimal decisions from classifier outputs in fields like medicine.
method Develops a transducer that calculates probabilities from classifier outputs, enabling expected-utility maximization.
result Improves prediction accuracy in drug discovery problems, sometimes close to theoretical maximum.
New method uses Riemannian geometry to quantify molecular shapes.
problem Quantifying molecular similarity for drug discovery.
method Riemannian geometry and Kähler quantization (KQMolSA).
result KQMolSA method compares well to existing shape similarity methods.