DiffATD efficiently discovers targets in partially observable environments using diffusion dynamics.
problem Efficiently discovering targets in partially observable environments with limited sampling.
method DiffATD uses diffusion dynamics to maintain a belief distribution over unobserved states, balancing exploration and exploitation.
result DiffATD outperforms baselines and supervised methods in diverse domains.
XRM discovers environments without human annotations for OOD methods.
problem Costly and biased manual annotations limit OOD methods.
method XRM trains twin networks to mimic mistakes, eliminating hyper-parameters.
result XRM achieves oracle worst-group-accuracy for OOD methods.
New method identifies causal graphs with limited data and noise.
problem Identifying causal graphs from observational data is generally impossible.
method Using additional data from two environments with different noise statistics, and assuming Gaussian noise.
result The entire causal graph can be uniquely identified with a constant number of environments.
UAED discovers adaptive environments for robust learning.
problem Avoiding spurious correlations in data.
method Unified framework that learns a distribution over data transformations.
result Improves worst-case accuracy on standard benchmarks.
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.
Bayesian nonparametrics enables dynamic skill discovery from expert data.
problem Fixed K for offline skill discovery in reinforcement learning.
method Variational inference, continuous relaxations, Bayesian nonparametrics.
result Nonparametric model with dynamically-changing number of options.
ISL improves causal structure learning with invariant structures across different environments.
problem Improving causal structure discovery for better generalization and explainability.
method ISL splits data into environments, learns invariant structures, and selects optimal classifiers based on graph structures.
result ISL accurately discovers causal structures and outperforms alternative methods on synthetic and real-world datasets.
Proposes MSS to identify causal structure from heterogeneous environments.
problem Distribution shifts between environments violate i.i.d. data assumption.
method Sparse mechanism shift hypothesis, score-based approach.
result Identifies entire causal structure with high probability.
Scientific discovery is limited by hypothesis redundancy, and hybrid methods can exploit non-local exploration.
problem Limitation of scientific discovery due to hypothesis redundancy.
method Hybrid discovery systems combining structured local search with LLM-generated non-local proposals.
result Hybrid methods can exploit non-local exploration when three geometric conditions co-occur.
Two environments are enough to infer causal graphs and counterfactuals.
problem Inferring causal relations from multiple environments, especially for nonlinear mechanisms.
method Using structural causal models and the invariance principle, the study shows that only two auxiliary environments are sufficient for causal graph inference and counterfactual inference.
result Two auxiliary environments are sufficient for identifying causal graphs and counterfactuals.
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.
In this paper we analyze both the scientific activities of Cahit Arf, a Turkish mathematician, and the social context in which he worked. We also discuss his work and social environment leading to the discovery of Arf invariant, Arf rings, Arf closure and Hasse-Arf theorem.
Materials discovery is decisive for tackling urgent challenges related to energy, the environment, health care and many others. In chemistry, conventional methodologies for innovation usually rely on expensive and incremental strategies to optimize properties from molecular structures. On the other hand, inverse approa…
Acquiring abilities in the absence of a task-oriented reward function is at the frontier of reinforcement learning research. This problem has been studied through the lens of empowerment, which draws a connection between option discovery and information theory. Information-theoretic skill discovery methods have garnere…
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.
In many scientific fields, such as economics and neuroscience, we are often faced with nonstationary time series, and concerned with both finding causal relations and forecasting the values of variables of interest, both of which are particularly challenging in such nonstationary environments. In this paper, we study c…
Proposes a method to improve few-shot transfer in off-dynamics RL.
problem Traditional RL struggles with transferring policies between environments with different dynamics.
method Introduces a penalty to regulate source-trained policies in target environments with limited data.
result Improves performance in various off-dynamics RL scenarios compared to existing methods.
New method identifies causal structure in exchangeable data.
problem Existing causal discovery methods struggle with i.i.d. data.
method Exchangeable data provides richer conditional independence structure.
result Exchangeable data allows for unique causal structure identification.
Bayesian method discovers PDEs with variable coefficients robustly.
problem Discovering PDEs from noisy data is challenging.
method Bayesian sparse learning with tBGL-SS and Gibbs sampler.
result Method enhances robustness and model selection criteria.
Study shows informed traders harm market makers but price discovery benefits outweigh costs.
problem Informed traders' impact on market makers' profitability.
method Agent-based model with heterogeneous learning agents, multi-agent reinforcement learning.
result Informed market order flow is harmful when aggregate informedness is low but beneficial as it increases.
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.
TSML tackles anomaly detection and pattern discovery in industrial time series data.
problem Extracting and exploiting information from large industrial data to reduce downtimes and manufacturing errors.
method TSML uses a pipeline of lightweight filters to process industrial time series data in parallel.
result TSML effectively detects anomalies and discovers patterns in industrial time series data.
We investigate the performance of dynamic portfolios constructed using more than 21,000 technical trading rules on 12 categorical and country-specific markets over the 2004-2015 study period, on rolling forward structures of different lengths. We also introduce a discrete false discovery rate (DFRD+/-) method for contr…
Framework tackles OOD challenges in molecule property prediction by modeling environments.
problem Challenges in modeling OOD samples for molecule property prediction.
method Soft causal learning framework incorporating chemistry theories and cross-attention mechanisms.
result Demonstrates well generalization ability on seven datasets.
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…
Unsupervised exploration and representation learning become increasingly important when learning in diverse and sparse environments. The information-theoretic principle of empowerment formalizes an unsupervised exploration objective through an agent trying to maximize its influence on the future states of its environme…
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…
FinCARE combines financial data and AI reasoning to improve causal analysis of financial performance.
problem Correlation-based analysis fails to capture true causal relationships in financial performance.
method Hybrid framework integrating causal discovery algorithms with financial domain knowledge from SEC filings and LLM reasoning.
result KG+LLM-enhanced methods improve causal discovery across PC, GES, and NOTEARS by 36-366%.
A new metric, Weighted Regret, unifies FDR and power evaluation in online multiple testing.
problem The asymmetric costs of false positives and false negatives in automated pipelines.
method Introducing Weighted Regret and Decoupled-OMT (DOMT) to unify FDR and power evaluation.
result DOMT achieves an order-optimal sublinear mitigation of threshold depletion in bursty environments.
OpenHAIV integrates OOD detection and incremental learning for open-world models.
problem Challenges in open-world recognition, especially in model knowledge updates and OOD detection.
method Unified pipeline combining OOD detection, new class discovery, and incremental fine-tuning.
result Models can autonomously acquire and update knowledge in open-world environments.
CAnDOIT discovers causal relationships using both observational and interventional time-series data.
problem Identifying causal relationships in the presence of hidden factors.
method CAnDOIT combines observational and interventional time-series data to reconstruct causal models.
result CAnDOIT effectively handles interventional data and enhances the accuracy of causal analysis.
FAIR-NN finds invariant variables for causal inference across diverse environments.
problem Nonparametric invariance and causal learning in regression models with varying joint distributions.
method FAIR-NN framework using adversarial optimization and neural networks.
result FAIR-NN identifies invariant variables and quasi-causal variables under minimal conditions.
Perceiving the surrounding environment in terms of objects is useful for any general purpose intelligent agent. In this paper, we investigate a fundamental mechanism making object perception possible, namely the identification of spatio-temporally invariant structures in the sensorimotor experience of an agent. We take…
LANCA uses ANM to learn latent causal factors without supervision.
problem Learning latent causal factors without supervision.
method LANCA employs a deterministic Wasserstein Auto-Encoder coupled with a differentiable ANM Layer.
result LANCA outperforms baselines on physics and photorealistic environments.
The options framework in reinforcement learning models the notion of a skill or a temporally extended sequence of actions. The discovery of a reusable set of skills has typically entailed building options, that navigate to bottleneck states. This work adopts a complementary approach, where we attempt to discover option…
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.
Novel online algorithm for hierarchical imitation learning.
problem Scalability issue in reinforcement learning and options discovery.
method Online Baum-Welch algorithm for hierarchical imitation learning.
result The online algorithm outperforms the batch version in both discrete and continuous environments.
In this paper we present our scientific discovery that good representation can be learned via continuous attention during the interaction between Unsupervised Learning(UL) and Reinforcement Learning(RL) modules driven by intrinsic motivation. Specifically, we designed intrinsic rewards generated from UL modules for dri…
Paper tackles action selection in deep RL, proposing a data-driven approach.
problem High-dimensional action selection in deep RL environments.
method Data-driven approach with knockoff sampling for minimal sufficient actions.
result Method surpasses alternative techniques in performance and rewards.
Study examines challenges and applications of machine learning in finance.
problem Challenges in applying machine learning to financial research due to market idiosyncrasies and methodological differences.
method Discussion of adjustments needed to conventional machine learning methodology to account for financial market peculiarities.
result Machine learning can be unified with financial research as a robust complement to econometric methods.
State of the art deep reinforcement learning algorithms take many millions of interactions to attain human-level performance. Humans, on the other hand, can very quickly exploit highly rewarding nuances of an environment upon first discovery. In the brain, such rapid learning is thought to depend on the hippocampus and…
Process mining is a research field focused on the analysis of event data with the aim of extracting insights in processes. Applying process mining techniques on data from smart home environments has the potential to provide valuable insights in (un)healthy habits and to contribute to ambient assisted living solutions. …
Adaptive teacher improves sample efficiency and mode coverage in sampling tasks.
problem Efficient exploration and mode coverage in sampling tasks with amortized inference.
method An adaptive training distribution (teacher) guides the training of the primary sampler (student).
result Improves sample efficiency and mode coverage across various tasks.
This paper detects Markov violations in RL with noise, improving policy development.
problem Partial observability and sensor/actuator noise invalidate Markovian assumptions in RL.
method Combines PCMCI causal discovery with Markov Violation score (MVS).
result Even substantial noise doesn't always disrupt multi-step dependencies.
New approach categorizes objective functions for embodied agents.
problem Understanding how objectives relate to each other and discovering new objectives.
method Introducing Action Perception Divergence (APD) to categorize objective functions.
result Introduces a spectrum of objectives from narrow to general, explaining various unsupervised objectives.
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…
SPARTAN learns sparse interaction graphs between objects in scenes.
problem Capturing structured interactions between entities in complex settings remains challenging.
method SPARTAN is a Transformer-based world model that learns sparse, context-dependent interaction graphs through sparsity regularization on attention patterns.
result SPARTAN achieves significantly improved few-shot adaptation to dynamics changes and robustness against distractors.
Boosting improves trend detection in financial data.
problem Discovering trends in financial data during crises and recoveries.
method Extends boosting to higher order integrated processes and series with roots near unity.
result Boosting captures downturns and recoveries more accurately.