Subspace Selection via DR-Submodular Maximization on Lattices

Proceedings of the AAAI Conference on Artificial Intelligence
doi 10.1609/aaai.v33i01.33014618
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Association for the Advancement of Artificial Intelligence (AAAI)

Related search

Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes

SIAM Journal on Computing
MathematicsComputer Science
2014English

Monotone Submodular Maximization Over a Matroid via Non-Oblivious Local Search

SIAM Journal on Computing
MathematicsComputer Science
2014English

Deterministic Algorithms for Submodular Maximization Problems

2015English

Note on Pseudolattices, Lattices and Submodular Linear Programs

Discrete Optimization
Computational TheoryApplied MathematicsTheoretical Computer ScienceMathematics
2008English

A Note on Variable Selection in Functional Regression via Random Subspace Method

Statistical Methods and Applications
UncertaintyStatisticsProbability
2018English

On Isomorphisms and Hyper-Reflexivity of Closed Subspace Lattices

International Journal of Mathematics and Mathematical Sciences
Mathematics
1991English

Whole-Page Optimization and Submodular Welfare Maximization With Online Bidders

ACM Transactions on Economics and Computation
StatisticsProbabilityMarketingEconomicsComputer ScienceComputational MathematicsEconometrics
2016English

Invariant Subspace Lattices for a Class of Operators

Pacific Journal of Mathematics
Mathematics
1981English

Weak Limits of Projections and Compactness of Subspace Lattices

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1987English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy