OFVF uses Bayesian plausibility sets for robust exploration in reinforcement learning.
problem Exploration in reinforcement learning, especially in poorly understood states and actions.
method Bayesian approach with plausibility sets constructed based on sensible value functions.
result OFVF constructs tighter optimistic estimates for exploration, leading to robust policies.
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.
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.
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.
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 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…
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…
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…
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.
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 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.
Shallow networks with local learning rules can match deep learning performance.
problem Training deep neural networks is biologically implausible; the goal is to achieve similar performance with shallow networks.
method Investigated shallow networks with one hidden layer and a single readout layer, using various local learning rules for the hidden layer and supervised learning for the readout layer.
result Shallow networks can achieve test accuracy comparable to deep learning models, suggesting the use of different datasets for testing.
AGATHA predicts promising research directions from scientific data.
problem Efficiently winnowing thousands of potential targets in drug discovery.
method Deep-learning hypothesis generation system that ranks plausible term-pairs.
result Best-in-class performance on an established benchmark, high recommendation scores across subdomains.
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.
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…
The paper relaxes constraints on predictive coding models, making them more biologically plausible.
problem Neurophysiological models of predictive coding are not fully biologically plausible.
method The paper relaxes constraints on standard predictive coding algorithms by removing neurally implausible features.
result The removal of neurally implausible features does not significantly affect learning performance.
Neural network models of early sensory processing typically reduce the dimensionality of streaming input data. Such networks learn the principal subspace, in the sense of principal component analysis (PCA), by adjusting synaptic weights according to activity-dependent learning rules. When derived from a principled cost…
Biological neural network mimics CCA for multi-channel data.
problem Implementing CCA in a biologically plausible neural network.
method Derive an online CCA algorithm with local synaptic updates for multi-compartmental neurons.
result The derived neural network architecture and synaptic updates resemble cortical pyramidal neuron behavior.
New neural network theory mimics physics laws, making computations more plausible.
problem Neural networks lack biological plausibility in computations.
method Variational framework of the least action principle, local in space and time.
result SpatioTemporal Local Propagation (STLP) scheme is biologically plausible.
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.
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.
Efficient method predicts plausible probability ranges for credal sets.
problem Computational complexity in training credal predictors for complex models.
method Grounded in relative likelihood, decalibration technique.
result Yields credal sets with strong performance across diverse tasks.
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…
SCS identifies a range of plausible equally weighted portfolios, quantifying selection uncertainty.
problem Uncertainty in selecting the best equally weighted portfolio subset.
method Introduces Selection Confidence Set (SCS) for EWPs, covering plausible portfolios with high probability.
result SCS quantifies selection uncertainty and covers the unknown optimal selection with high probability.
Method identifies shifts leading to large model performance differences.
problem Detecting shifts in distribution that affect model performance.
method Parametric changes in causal mechanisms define robustness sets; worst-case optimization problem approximated as non-convex quadratic.
result Second-order approximation of worst-case loss for small shifts, leading to efficient algorithms.
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.
EXAGREE selects a stakeholder-aligned model to reduce conflicting explanations in machine learning.
problem Conflicting explanations from different attribution methods limit the adoption of machine learning models in safety-critical domains.
method EXAGREE is a two-stage framework that selects a Stakeholder-Aligned Explanation Model (SAEM) from a set of similar-performing models, maximizing Stakeholder-Machine Agreement (SMA).
result EXAGREE achieves simultaneous gains in faithfulness, plausibility, and fairness over baselines while preserving task accuracy.
Unsupervised image inpainting models generate plausible reconstructions from incomplete data.
problem Inpainting without paired or unpaired training data.
method Conditional GAN with latent component dependency for generating image distributions.
result Model generates a distribution of plausible images from incomplete observations.
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.
Bayesian Predictive Coding improves deep learning uncertainty quantification.
problem Limitations of maximum a posteriori and maximum likelihood estimates in predictive coding.
method Developed Bayesian Predictive Coding (BPC) that estimates a posterior distribution over network parameters.
result BPC offers comparable uncertainty quantification to existing methods in Bayesian deep learning and improves convergence properties.
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.
Neural network learns manifold structure for semi-supervised learning.
problem Semi-supervised learning on manifolds with explicit graph representations.
method Feed-forward neural network with two layers, learning manifold structure and classification.
result Neural network achieves semi-supervised learning on non-trivial manifolds.
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.
SODA-RL learns diverse treatment options for hypotension from data.
problem Identifying the best treatment for acute hypotension from observational data.
method SODA-RL: Safely Optimized, Diverse, and Accurate Reinforcement Learning.
result SODA-RL identifies distinct, plausible treatment options from observational data.
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.
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.
Researchers disrupt Gaussian model inference to test adversarial attacks.
problem Disrupting conditional inference in multivariate Gaussian models under adversarial conditions.
method Considered white- and grey-box settings with complete and incomplete knowledge of the Gaussian distribution, respectively. Reduced to quadratic and stochastic quadratic programs. Derived structural properties for solution methods.
result Demonstrated the impact and efficacy of attacks in various applications, including real estate evaluation, interest rate estimation, and signals processing.
As researchers and practitioners of applied machine learning, we are given a set of requirements on the problem to be solved, the plausibly obtainable data, and the computational resources available. We aim to find (within those bounds) reliably useful combinations of problem, data, and algorithm. An emphasis on algori…
In this paper, we introduce the Fairness GAN, an approach for generating a dataset that is plausibly similar to a given multimedia dataset, but is more fair with respect to protected attributes in allocative decision making. We propose a novel auxiliary classifier GAN that strives for demographic parity or equality of …
We present some plausible definitions for the tangent grupoid of a manifold M, as well as some of the known applications of the structure. This is a kind of introductory note.
Skip connections improve biologically-inspired learning rules.
problem Biologically-inspired learning rules often underperform compared to backpropagation.
method Introduced skip connections between intermediate layers in biologically-motivated learning rules.
result Skip connections can match the performance of backpropagation and are robust to hyper-parameters.
New method improves robust MDP solutions without confidence regions.
problem Computing policies with provable worst-case guarantees in reinforcement learning.
method Optimizes ambiguity sets using Bayesian inference to achieve better solutions.
result Achieves better solutions with the same robustness guarantees.
Releasing full data records is one of the most challenging problems in data privacy. On the one hand, many of the popular techniques such as data de-identification are problematic because of their dependence on the background knowledge of adversaries. On the other hand, rigorous methods such as the exponential mechanis…
Conformal Prediction Regions match Imprecise Highest Density Regions under consonance.
problem Matching conformal prediction regions with highest density regions.
method Using consonance and the Imprecise Probability theory of clouds.
result Imprecise Highest Density Regions are equivalent to Conformal Prediction Regions under consonance.
We develop a method for user-controllable semantic image inpainting: Given an arbitrary set of observed pixels, the unobserved pixels can be imputed in a user-controllable range of possibilities, each of which is semantically coherent and locally consistent with the observed pixels. We achieve this using a deep generat…