Survey of integrating physics knowledge into machine learning models.
problem Mitigating data shortage and ensuring physical plausibility.
method Combining physics knowledge with machine learning models.
result Summarizes recent works in physics-informed machine learning.
PhysVarMix predicts diverse urban trajectories with physics constraints.
problem Predicting complex urban agent trajectories with multiple plausible scenarios.
method Physics-informed variational mixture model combining learning and physics constraints.
result Superior performance compared to existing methods on benchmark datasets.
Develops experimental design for discovering missing physics in bioreactors.
problem Discovering missing physics in incomplete model structures of process systems.
method Combines universal differential equations and symbolic regression with sequential experimental design.
result Successfully recovered true model structure of a bioreactor using machine learning techniques.
We propose a method to model multi-agent behaviors with limited observation and mechanical constraints.
problem Modeling real-world multi-agent behaviors with limited observation and mechanical constraints.
method Decentralized generative models with partial observation and mechanical constraints based on hierarchical variational recurrent neural networks.
result Our method effectively models and predicts biologically plausible behaviors with minimal constraint violations.
Single model learns physics from diverse data.
problem Lack of universal physics models for diverse applications.
method General Physics Transformer (GPhyT) trained on diverse physics data.
result Single model achieves superior performance across multiple physics domains.
There is significant interest in using modern neural networks for scientific applications due to their effectiveness in modeling highly complex, non-linear problems in a data-driven fashion. However, a common challenge is to verify the scientific plausibility or validity of outputs predicted by a neural network. This w…
Physics-informed neural networks improve model accuracy and efficiency.
problem Accurate dynamic models for technical systems are hard to achieve.
method Physics-informed neural ordinary differential equations (PINODE) integrating Lagrangian mechanics.
result Hybrid model combines physical insight and data approximation.
This paper proposes an in-depth re-thinking of neural computation that parallels apparently unrelated laws of physics, that are formulated in the variational framework of the least action principle. The theory holds for neural networks that are also based on any digraph, and the resulting computational scheme exhibits …
Bayesian symbolic regression automates model discovery from data.
problem Learning closed-form mathematical models from data using heuristic methods.
method Probabilistic approach to symbolic regression, connecting to information theory and statistical physics.
result Probabilistic approach provides model plausibility and performance guarantees.
Deep learning has achieved astonishing results on many tasks with large amounts of data and generalization within the proximity of training data. For many important real-world applications, these requirements are unfeasible and additional prior knowledge on the task domain is required to overcome the resulting problems…
We present a novel approach to weakly supervised object detection. Instead of annotated images, our method only requires two short videos to learn to detect a new object: 1) a video of a moving object and 2) one or more "negative" videos of the scene without the object. The key idea of our algorithm is to train the obj…
PhysicsFormer improves TSF models for GSWF with WEATHER-5K dataset.
problem Lack of comprehensive datasets for GSWF.
method PhysicsFormer combines dynamic core and Transformer, enforcing physical consistency.
result PhysicsFormer outperforms TSF models in operational forecasting.
aMCL uses annealing to improve hypothesis diversity in ambiguous tasks.
problem Limitations of Winner-takes-all in predicting plausible hypotheses.
method Combines simulated annealing with Multiple Choice Learning (MCL).
result Enhanced exploration of hypothesis space during training.
ARFs generate plausible counterfactuals for models, improving model understanding.
problem Creating realistic counterfactuals for model analysis.
method Adversarial Random Forests (ARFs) for generating plausible counterfactuals.
result ARFs efficiently generate plausible counterfactuals in a model-agnostic way.
We develop a cross-sectional research design to identify causal effects in the presence of unobservable heterogeneity without instruments. When units are dense in physical space, it may be sufficient to regress the "spatial first differences" (SFD) of the outcome on the treatment and omit all covariates. The identifyin…
We define and compute plausible counterfactual explanations using density constraints.
problem Efficiently compute plausible counterfactual explanations for machine learning models.
method Propose and study a formal definition of plausible counterfactual explanations, use density estimators, and introduce convex density constraints.
result Convex density constraints ensure plausible and feasible counterfactual explanations.
New method generates plausible counterfactuals for time series classification.
problem Generating realistic counterfactuals for time series data.
method Gradient-based optimization with soft-DTW alignment and multi-faceted loss function.
result Our method outperforms existing approaches in temporal realism and distributional alignment.
New non-semisimple Ising anyons enable robust universal quantum computation.
problem Limitation of semisimple theories in universal topological quantum computation.
method Developed non-semisimple Ising anyon model with new anyon types indexed by α. result Robust universality of braiding persists over an open interval of α. Method generates plausible financial stress scenarios using large deviations.
problem Misleading risk management by overlooking or overemphasizing implausible scenarios.
method Exploits large-deviations principle to concentrate risk factors near most likely stress configurations.
result Can generate informative stress scenarios even with limited historical data.
Optimism about the poorly understood states and actions is the main driving force of exploration for many provably-efficient reinforcement learning algorithms. We propose optimism in the face of sensible value functions (OFVF)- a novel data-driven Bayesian algorithm to constructing Plausibility sets for MDPs to explore…
AR algorithm simplifies backpropagation with improved scalability and biological plausibility.
problem Improving backpropagation algorithms for complex neural networks and biological plausibility.
method Introducing learnable backwards weights and avoiding nonlinear derivative computations; relaxing frozen feedforward pass assumption.
result Simplified AR algorithm maintains performance on complex CNN architectures and challenging datasets.
New model separates objects in scenes, enabling novel arrangements and depth.
problem Lack of modular, compositional scene modeling in generative models.
method Ensemble of generative models (experts) compete for explaining different parts of a scene.
result Model generates scenes with novel object arrangement and depth ordering.
Derives a biologically plausible neural network for Slow Feature Analysis.
problem Learning latent features from time series data.
method Starting from an SFA objective, derives Bio-SFA with a biologically plausible neural network implementation.
result Validates Bio-SFA on naturalistic stimuli, reproducing interesting properties of brain cells.
A principled approach to understand network structures is to formulate generative models. Given a collection of models, however, an outstanding key task is to determine which one provides a more accurate description of the network at hand, discounting statistical fluctuations. This problem can be approached using two p…
New framework predicts diverse, contextually plausible 3D human motions.
problem Predicting multiple plausible future 3D poses given observed poses.
method Developed a new variational framework that conditions latent variable on past observation to encourage relevant information.
result Our approach generates motions of higher quality and preserves contextual information.
GAIT-prop derives a biologically plausible learning rule from backpropagation.
problem Biological implausibility in traditional backpropagation for neural networks.
method GAIT-prop uses a top-down model to convert output error into plausible targets for weight updates.
result GAIT-prop and backpropagation give identical weight updates under certain conditions.
Backpropagation is explained as a diffusion process in neural networks.
problem The biological plausibility of Backpropagation is questioned.
method Demonstrated that time-delayed neurons and forward-backward waves approximate the gradient in deep networks.
result Backpropagation can be interpreted as a diffusion process, approximating the gradient for non-fast inputs.
New learning rules from information bottleneck improve deep learning without precise labels.
problem Training deep neural networks with backpropagation is biologically implausible.
method Kernelized information bottleneck principle with 3-factor Hebbian structure.
result The new learning rules perform nearly as well as backpropagation on image classification tasks.
Several techniques for domain adaptation have been proposed to account for differences in the distribution of the data used for training and testing. The majority of this work focuses on a binary domain label. Similar problems occur in a scientific context where there may be a continuous family of plausible data genera…
New measures for prediction validity and consonant plausibility introduced.
problem Challenges in predicting future observations and quantifying prediction uncertainty.
method Introducing Type-2 validity and using consonant plausibility measures and conformal prediction.
result Achieving both Type-1 and Type-2 validity through consonant plausibility measures and conformal prediction.
By and large, Backpropagation (BP) is regarded as one of the most important neural computation algorithms at the basis of the progress in machine learning, including the recent advances in deep learning. However, its computational structure has been the source of many debates on its arguable biological plausibility. In…
New method isolates epistemic uncertainty in diffusion models, improving plausibility scores.
problem Uncertainty quantification in diffusion models, especially epistemic uncertainty.
method Fisher information based approach using FLARE (Fisher-Laplace Randomized Estimator).
result FLARE improves uncertainty estimation in synthetic time-series generation tasks.
Training deep neural networks with the error backpropagation algorithm is considered implausible from a biological perspective. Numerous recent publications suggest elaborate models for biologically plausible variants of deep learning, typically defining success as reaching around 98% test accuracy on the MNIST data se…
New algorithm shows neural networks can learn without full backpropagation.
problem Stochastic gradient descent with backpropagation is non-biologically plausible.
method Random and fixed backpropagation weights in a feedback alignment algorithm.
result Error converges to zero exponentially fast in overparameterized networks.
Proposes a new neural network approach to credit assignment.
problem Credit assignment problem in deep neural networks.
method Contrastive similarity matching objective function.
result Deep networks learn to match similarity between layers.
A new method for robot manipulation tasks using imagined object goals.
problem Learning robot manipulation in sparse reward environments.
method Train objects to reach target positions, then use predictions to create a curriculum of tasks.
result Higher success rates in challenging learning scenarios compared to alternatives.
Bayesian machine scientist uncovers accurate models from data.
problem Challenging scientific problems require interpretable mathematical models.
method Bayesian approach using Markov chain Monte Carlo to explore model space.
result Out-of-sample predictions are more accurate than existing methods.
Many real-world vision problems suffer from inherent ambiguities. In clinical applications for example, it might not be clear from a CT scan alone which particular region is cancer tissue. Therefore a group of graders typically produces a set of diverse but plausible segmentations. We consider the task of learning a di…
This note improves correlation stress tests using geodesic distance.
problem Improving financial risk management through better covariance stress tests.
method Proposes a new geometrically invariant definition of correlation stress tests.
result Demonstrates a submanifold approach to stress testing covariance matrices.
We propose to interpret distribution model risk as sensitivity of expected loss to changes in the risk factor distribution, and to measure the distribution model risk of a portfolio by the maximum expected loss over a set of plausible distributions defined in terms of some divergence from an estimated distribution. The…
One conjecture in both deep learning and classical connectionist viewpoint is that the biological brain implements certain kinds of deep networks as its back-end. However, to our knowledge, a detailed correspondence has not yet been set up, which is important if we want to bridge between neuroscience and machine learni…
Integrated Assessment Models (IAMs) are mainstay tools for assessing the long-term interactions between climate and the economy and for deriving optimal policy responses in the form of carbon prices. IAMs have been criticized for controversial discount rate assumptions, arbitrary climate damage functions, and the inade…
New learning algorithm mimics biological neural networks.
problem Biologically implausible backpropagation for directed neural networks.
method Introduces new neuronal dynamics and learning rule for arbitrary architectures, sparsity-inducing pruning method, and dynamical-systems characterization.
result Prunes irrelevant connections and improves learning efficiency.
Automated suggestions help train technicians diagnose incidents faster.
problem Manual and time-consuming incident diagnosis by train maintenance technicians.
method Developed and deployed a learning machine to suggest diagnostics to technicians.
result The model refines its accuracy through feedback from experts and uses feature engineering.
New method uses entropy to generate multiple plausible causal maps.
problem Learning causal relationships from noisy data can lead to artifacts in DAGs.
method Entropy-based inference to generate an ensemble of plausible causal graphs.
result Multiple causal maps consistent with underlying data variability.
Stock markets show unusual overnight and intraday returns.
problem Unusual patterns of overnight and intraday returns in stock markets.
method Analyzed features of the returns to deduce the cause.
result The only plausible explanation for these returns is that they are due to market manipulation.
Cold-start PV forecasting uses synthetic histories to train time-series foundation models.
problem Cold-start PV forecasting
method Zero-shot pipeline with synthetic histories
result TabPFN-TS achieves the lowest error under Real Feedback strategy
Major histocompatibility complex class two (MHC-II) molecules are trans-membrane proteins and key components of the cellular immune system. Upon recognition of foreign peptides expressed on the MHC-II binding groove, helper T cells mount an immune response against invading pathogens. Therefore, mechanistic identificati…