Robust Equation Discovery and Sparse Sensing with Guarantees

Published on ● Video Link: https://www.youtube.com/watch?v=INRxuhIVo88



Duration: 59:57
310 views
11


Krithika Manohar (UW)
https://simons.berkeley.edu/talks/krithika-manohar-uw-2024-06-14
AI≡Science: Strengthening the Bond Between the Sciences and Artificial Intelligence

Extracting governing equations and dynamics from data is crucial for prediction, sensing and control of resource-constrained engineering systems. Identifying the fewest possible model terms or sensor measurements often translates into sparsity penalties on optimization design variables. Current approaches rely on relaxation, heuristics, and trial-and-error selection of hyperparameters, which challenge the interpretability and verification of resulting models. In this talk, we propose a statistical mechanics approach for robust sparse equation discovery, using free energies to analyze the optimization landscape, optimize hyperparameters and quantify uncertainty with respect to noise and data volume. We illustrate how this perspective adapts to optimal sensor placement, providing optimization landscapes and critical noise regimes for reconstruction of high-dimensional fields from sparse sensors and data-driven priors. We showcase how these tools can be used for constrained optimization of sensor placement in nuclear digital twins.




Other Videos By Simons Institute for the Theory of Computing


2024-08-04On counting subgraphs and why counting seeds makes more sense (if one thinks about it clearly)
2024-08-04Testing Intersectingness of Uniform Families or how Dana and I intersected
2024-08-04Recent Developments in Testing Bounded-Degree Graphs
2024-08-04Property Testing with Incomplete or Manipulated Inputs
2024-08-01Are there graphs whose shortest path structure requires large edge weights?
2024-08-01Graph Connectivity Using Star Contraction
2024-08-01Agnostic Proper Learning of Monotone Functions: Beyond the Black-Box Correction Barrier
2024-08-01Sparsifying Set Systems for Coverage Problems
2024-07-31Recent Progress on Euclidean Spanners
2024-07-31Space is a latent sequence: A theory of hippocampus and PFC
2024-06-21Robust Equation Discovery and Sparse Sensing with Guarantees
2024-06-21Data is as Data Does: The Influence of Computation on Inference
2024-06-21Some thoughts on ML-based protein engineering
2024-06-21Machine learning models of differential gene expression
2024-06-21Open challenges in AI for molecular design: representation, experimental alignment, and...
2024-06-21Illuminating protein space with generative models
2024-06-21Symmetries in Machine Learning for Materials Science
2024-06-21Large ML potentials for chemistry: generalization, inductive biases, and cancellation of errors
2024-06-21Deep learning and numerical methods intersections for improving molecular and fluid dynamics
2024-06-21ML gradients in Molecular Simulations
2024-06-21Generalizable sampling of conformational ensembles with latent space dynamics



Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
AI≡Science: Strengthening the Bond Between the Sciences and Artificial Intelligence
Krithika Manohar