Publication:5053276
From MaRDI portal
Youssef M. Marzouk, Jayanth Jagalur-Mohan
Publication date: 6 December 2022
Full work available at URL: https://arxiv.org/abs/2006.04554
mutual information; inverse problems; submodularity; Bayesian statistics; uncertainty quantification; optimal experimental design; greedy methods; non-submodular functions
68T05: Learning and adaptive systems in artificial intelligence
Related Items
An Offline-Online Decomposition Method for Efficient Linear Bayesian Goal-Oriented Optimal Experimental Design: Application to Optimal Sensor Placement, Learning physics-based models from data: perspectives from inverse problems and model reduction, Large-scale Bayesian optimal experimental design with derivative-informed projected neural network
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- High dimensional covariance matrix estimation using a factor model
- An indefinite variant of LOBPCG for definite matrix pencils
- High-dimensional covariance matrix estimation in approximate factor models
- On Bayesian A- and D-optimal experimental designs in infinite dimensions
- Multiplicative submodularity of a matrix's principal minor as a function of the set of its rows and some combinatorial applications
- Faster least squares approximation
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
- A concavity inequality for symmetric norms
- Matrix versions of the Cauchy and Kantorovich inequalities
- Spanning-tree extensions of the Hadamard-Fischer inequalities
- Influential observations, high leverage points, and outliers in linear regression
- Jensen's inequality for operators and Loewner's theorem
- Bayesian experimental design: A review
- Statistical and computational inverse problems.
- Trace minimization and definiteness of symmetric pencils
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Restricted strong convexity implies weak submodularity
- An inequality for subadditive functions on a distributive lattice, with application to determinantal inequalities
- Subadditive functions on a distributive lattice and an extension of Szász's inequality
- Some large-scale matrix computation problems
- Submodular functions and optimization.
- A new approach to Cholesky-based covariance regularization in high dimensions
- MM Optimization Algorithms
- Determinantal Point Processes for Machine Learning
- Inverse problems: A Bayesian perspective
- 10.1162/153244303768966085
- On a Measure of the Information Provided by an Experiment
- A Schwarz Inequality for Convex Operator Functions
- Optimal Low-rank Approximations of Bayesian Linear Inverse Problems
- An Accelerated Sequential Algorithm for ProducingD-Optimal Designs
- On principal submatrices
- Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems
- A Stable Generalized Eigenvalue Problem
- An analysis of approximations for maximizing submodular set functions—I
- The Hat Matrix in Regression and ANOVA
- Best Algorithms for Approximating the Maximum of a Submodular Set Function
- A matrix version of the Ky Fan generalization of the kantorovich inequality
- The Concave-Convex Procedure
- JENSEN'S OPERATOR INEQUALITY
- Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature
- On the Optimality of the Backward Greedy Algorithm for the Subset Selection Problem
- An optimal approximation for submodular maximization under a matroid constraint in the adaptive complexity model
- Parallelizing greedy for submodular set function maximization in matroids and beyond
- Unconstrained submodular maximization with constant adaptive complexity
- The adaptive complexity of maximizing a submodular function
- Submodular Maximization with Nearly Optimal Approximation, Adaptivity and Query Complexity
- Submodular Function Maximization in Parallel via the Multilinear Relaxation
- Adaptive Forward-Backward Greedy Algorithm for Learning Sparse Representations
- Optimal Design of Experiments
- Learning with Submodular Functions: A Convex Optimization Perspective
- Submodular function maximization via the multilinear relaxation and contention resolution schemes
- Functions of Matrices
- Symmetric norms and reverse inequalities to Davis and Hansen-Pedersen characterizations of operator convexity
- Elements of Information Theory
- Matroids and the greedy algorithm
- On the Efficient Design of Statistical Investigations
- An operator inequality
- An approximation guarantee of the greedy descent algorithm for minimzing a supermodular set function.
