Automated PDE discovery from multiple noisy experiments.
problem Inherent variability in experiments makes single experiment inference unreliable.
method Randomised adaptive group Lasso sparsity estimator in deep learning framework.
result More generalizable PDEs found from multiple datasets.
Extends causal discovery to group variables, improving performance in real-world applications.
problem Inferring cause-effect relationships from grouped data.
method Two-step approach: infer causal order and select models.
result Strong performance in simulations and real-world assembly line data.
New framework discovers non-affine continuous symmetries in neural networks.
problem Lack of efficient methods for detecting non-affine continuous symmetries in neural networks.
method Computational framework for discovering infinitesimal generators of multi-parameter group actions.
result Framework can discover non-affine continuous symmetries in neural networks.
Paper discovers governing equations from data using differential invariants.
problem Discovering partial differential equations from data is challenging.
method The paper proposes a pipeline based on differential invariants to reduce the search space and adhere to symmetry.
result DI-SINDy method outperforms other symmetry-informed methods in PDE discovery.
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.
We tackle causal discovery in linear systems with measurement error and unobserved causes.
problem Causal discovery in linear systems with measurement error and unobserved causes.
method Characterization of identifiability based on the mixing matrix, proposing causal structure learning methods.
result The structure of causal models can be identified under certain faithfulness assumptions.
I give my view of the early history of the discovery of hyperbolic structures on knot complements from my early work on representations of knot groups into matrix groups to my meeting with William Thurston in 1976. (This article was written by Robert Riley about ten years before his death in 2000 and never submitted fo…
Paper proposes a new dataset for group anomaly detection in physics.
problem Group anomaly detection in physics.
method Development of a synthetic benchmark dataset and comparison of anomaly detection techniques.
result Demonstrated performance of anomaly detection techniques on the new dataset.
IEN speeds up T-Rex+GVS for fast, efficient GWAS.
problem Efficiently selecting groups of genetic variants in large-scale genomics studies.
method Informed Elastic Net (IEN) as a faster base selector for T-Rex+GVS.
result IEN reduces computation time while maintaining high TPR and FDR control.
Develops robust knockoffs for controlling false discoveries in financial data.
problem Challenges in variable selection with highly correlated data in finance and economics.
method Robustified knockoff framework addressing high dependence and time correlation.
result Identifies new important groups of factors on top of known drivers.
We report on the following highlights from among the many discoveries made in Noncommutative Geometry since year 2000: 1) The interplay of the geometry with the modular theory for noncommutative tori, 2) Advances on the Baum-Connes conjecture, on coarse geometry and on higher index theory, 3) The geometrization of the …
We investigate the problem of truth discovery based on opinions from multiple agents who may be unreliable or biased. We consider the case where agents' reliabilities or biases are correlated if they belong to the same community, which defines a group of agents with similar opinions regarding a particular event. An age…
AFTNet uses a network-constrained Weibull model for biomarker discovery.
problem Discovering biomarkers from survival data with correlated predictors.
method Survival analysis method based on Weibull AFT model, incorporating network constraints and penalized likelihood for variable selection.
result Theoretical consistency and efficient algorithm for AFTNet estimator validated on synthetic and real data.
Novel framework identifies pump-specific deterioration rates using Bayesian hierarchical hazard modeling and causal discovery.
problem Challenges in asset management due to heterogeneous deterioration rates in pump equipment.
method Bayesian hierarchical hazard modeling with causal discovery, GPU-accelerated No-U-Turn Sampling (NUTS), and DirectLiNGAM.
result Identified striking heterogeneity in deterioration rates, with negative effects 400 times larger than positive effects.
The false discovery rate (FDR)---the expected fraction of spurious discoveries among all the discoveries---provides a popular statistical assessment of the reproducibility of scientific studies in various disciplines. In this work, we introduce a new method for controlling the FDR in meta-analysis of many decentralized…
New method detects causal relationships from noisy measurements.
problem Discover causal relationships from noisy, imperfect measurements.
method Transformed Independent Noise (TIN) condition and ordered group decomposition.
result Identifies causal graph structure without over-complete ICA.
The theory of complex hyperbolic discrete groups is still in its childhood but promises to grow into a rich subfield of geometry. In this paper I will discuss some recent progress that has been made on complex hyperbolic deformations of the modular group and, more generally, triangle groups. These are some of the simpl…
Discrete groups act properly on 3-space, solving Milnor's question.
problem Proper actions of discrete groups on 3-space.
method Historical review and recent progress.
result Existence of proper affine actions of free groups on 3-space.
There is a significant literature on methods for incorporating knowledge into multiple testing procedures so as to improve their power and precision. Some common forms of prior knowledge include (a) beliefs about which hypotheses are null, modeled by non-uniform prior weights; (b) differing importances of hypotheses, m…
We introduce a framework for dynamic adversarial discovery of information (DADI), motivated by a scenario where information (a feature set) is used by third parties with unknown objectives. We train a reinforcement learning agent to sequentially acquire a subset of the information while balancing accuracy and fairness …
SOCP uses SOM to find groups and local calibration buffers for better regional coverage.
problem Heterogeneous regional coverage gaps in conformal prediction.
method Self-Organizing Map (SOM) for group discovery; local calibration buffers at BMU or fixed grid.
result Reduces regional coverage gaps on 7/8 benchmarks by 7.1%.
Boolean matrix factorization (BMF) is a popular and powerful technique for inferring knowledge from data. The mining result is the Boolean product of two matrices, approximating the input dataset. The Boolean product is a disjunction of rank-1 binary matrices, each describing a feature-relation, called pattern, for a g…
The postulate of independence of cause and mechanism (ICM) has recently led to several new causal discovery algorithms. The interpretation of independence and the way it is utilized, however, varies across these methods. Our aim in this paper is to propose a group theoretic framework for ICM to unify and generalize the…
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 algorithm groups variables by ancestral relationships to improve causal graph estimation accuracy.
problem Difficulty in estimating causal graphs with small sample sizes relative to variables.
method CAG algorithm groups variables based on ancestral relationships, reducing complexity and improving accuracy.
result CAG outperforms existing methods in estimation accuracy and computation time.
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.
Abstraction plays a key role in concept learning and knowledge discovery; this paper is concerned with computational abstraction. In particular, we study the nature of abstraction through a group-theoretic approach, formalizing it as symmetry-driven---as opposed to data-driven---hierarchical clustering. Thus, the resul…
CB-SLICE identifies concept-based error slices in deep learning models.
problem Systematic errors in deep learning models on specific groups.
method Concept Bottleneck Models (CBMs) and concept representations.
result CB-SLICE outperforms state-of-the-art methods in error slice identification.
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.
In many practical applications of multiple hypothesis testing using the False Discovery Rate (FDR), the given hypotheses can be naturally partitioned into groups, and one may not only want to control the number of false discoveries (wrongly rejected null hypotheses), but also the number of falsely discovered groups of …
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 discovers symmetries in differential equations from data.
problem Directly identifying Lie symmetries from scattered data without explicit equations.
method Numerical scheme using manifold learning and linear system construction.
result Accuracy and robustness demonstrated in various differential equations.
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.
This paper tackles causal interactions in mixtures of DAGs using interventions.
problem Learning causal interactions among variables governed by a mixture of causal systems.
method Establishes necessary and sufficient conditions for intervention size, designs an adaptive algorithm.
result Identifies true edges in a mixture of DAGs using optimal or near-optimal interventions.
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.
Clustering analysis is one of the most widely used statistical tools in many emerging areas such as microarray data analysis. For microarray and other high-dimensional data, the presence of many noise variables may mask underlying clustering structures. Hence removing noise variables via variable selection is necessary…
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.
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.
We describe a case of an interplay between human and computer proving which played a role in the discovery of an interesting mathematical result. The unusual feature of the use of computers here was that a computer generated but human readable proof was read, understood, generalized and abstracted by mathematicians to …
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.
We introduce interactive structure discovery, a generic framework that encompasses many interactive learning settings, including active learning, top-k item identification, interactive drug discovery, and others. We adapt a recently developed active learning algorithm of Tosh and Dasgupta (2017) for interactive structu…
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.
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.
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.