scientific article; zbMATH DE number 7626767
From MaRDI portal
Publication:5053276
Cites work
- 10.1162/153244303768966085
- A concavity inequality for symmetric norms
- A matrix version of the Ky Fan generalization of the kantorovich inequality
- A new approach to Cholesky-based covariance regularization in high dimensions
- A Schwarz Inequality for Convex Operator Functions
- A Stable Generalized Eigenvalue Problem
- Adaptive Forward-Backward Greedy Algorithm for Learning Sparse Representations
- An Accelerated Sequential Algorithm for ProducingD-Optimal Designs
- An analysis of approximations for maximizing submodular set functions—I
- An approximation guarantee of the greedy descent algorithm for minimzing a supermodular set function.
- An improved approximation algorithm for the column subset selection problem
- An indefinite variant of LOBPCG for definite matrix pencils
- An inequality for subadditive functions on a distributive lattice, with application to determinantal inequalities
- An operator inequality
- An optimal approximation for submodular maximization under a matroid constraint in the adaptive complexity model
- Bayesian experimental design: A review
- Best Algorithms for Approximating the Maximum of a Submodular Set Function
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Determinantal point processes for machine learning
- Distributed submodular maximization
- Elements of Information Theory
- Faster least squares approximation
- Functions of Matrices
- High dimensional covariance matrix estimation using a factor model
- High-dimensional covariance matrix estimation in approximate factor models
- scientific article; zbMATH DE number 3144516 (Why is no real title available?)
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 47926 (Why is no real title available?)
- scientific article; zbMATH DE number 1219584 (Why is no real title available?)
- scientific article; zbMATH DE number 554737 (Why is no real title available?)
- scientific article; zbMATH DE number 1416629 (Why is no real title available?)
- scientific article; zbMATH DE number 5174567 (Why is no real title available?)
- scientific article; zbMATH DE number 967931 (Why is no real title available?)
- scientific article; zbMATH DE number 3062951 (Why is no real title available?)
- Influential observations, high leverage points, and outliers in linear regression
- Inverse problems: a Bayesian perspective
- Jensen's inequality for operators and Loewner's theorem
- JENSEN'S OPERATOR INEQUALITY
- Learning with submodular functions: a convex optimization perspective
- Matrices, moments and quadrature with applications
- Matrix versions of the Cauchy and Kantorovich inequalities
- Matroids and the greedy algorithm
- Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems
- MM optimization algorithms
- Multiplicative submodularity of a matrix's principal minor as a function of the set of its rows and some combinatorial applications
- On a Measure of the Information Provided by an Experiment
- On Bayesian A- and D-optimal experimental designs in infinite dimensions
- On principal submatrices
- On the Efficient Design of Statistical Investigations
- On the Optimality of the Backward Greedy Algorithm for the Subset Selection Problem
- Optimal approximation for the submodular welfare problem in the value oracle model
- Optimal Design of Experiments
- Optimal low-rank approximations of Bayesian linear inverse problems
- Parallelizing greedy for submodular set function maximization in matroids and beyond
- Restricted strong convexity implies weak submodularity
- Some large-scale matrix computation problems
- Spanning-tree extensions of the Hadamard-Fischer inequalities
- Statistical and computational inverse problems.
- Subadditive functions on a distributive lattice and an extension of Szász's inequality
- Submodular function maximization in parallel via the multilinear relaxation
- Submodular function maximization via the multilinear relaxation and contention resolution schemes
- Submodular functions and optimization.
- Submodular maximization with nearly optimal approximation, adaptivity and query complexity
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
- Symmetric norms and reverse inequalities to Davis and Hansen-Pedersen characterizations of operator convexity
- The adaptive complexity of maximizing a submodular function
- The Concave-Convex Procedure
- The Hat Matrix in Regression and ANOVA
- Trace minimization and definiteness of symmetric pencils
- Unconstrained submodular maximization with constant adaptive complexity
Cited in
(15)- Greedy guarantees for non-submodular function maximization under independent system constraint with applications
- 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
- A greedy sensor selection algorithm for hyperparameterized linear Bayesian inverse problems with correlated noise models
- Large-scale Bayesian optimal experimental design with derivative-informed projected neural network
- Batch greedy maximization of non-submodular functions: Guarantees and applications to experimental design
- Optimal design of large-scale nonlinear Bayesian inverse problems under model uncertainty
- Optimal experimental design: formulations and computations
- Greedy selection of optimal location of sensors for uncertainty reduction in seismic moment tensor inversion
- Non-intrusive optimal experimental design for large-scale nonlinear Bayesian inverse problems using a Bayesian approximation error approach
- Sequential infinite-dimensional Bayesian optimal experimental design with derivative-informed latent attention neural operator
- Accurate, scalable, and efficient Bayesian optimal experimental design with derivative-informed neural operators
- Bayesian D-optimal experimental designs via column subset selection
- Optimal design for linear models via gradient flow
- Expected information gain estimation via density approximations: sample allocation and dimension reduction
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5053276)
