ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1707.04347
  4. Cited By
Weakly Submodular Maximization Beyond Cardinality Constraints: Does
  Randomization Help Greedy?

Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy?

13 July 2017
Lin Chen
Moran Feldman
Amin Karbasi
ArXivPDFHTML

Papers citing "Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy?"

5 / 5 papers shown
Title
Submodular Framework for Structured-Sparse Optimal Transport
Submodular Framework for Structured-Sparse Optimal Transport
Piyushi Manupriya
Pratik Jawanpuria
Karthik S. Gurumoorthy
SakethaNath Jagarlapudi
Bamdev Mishra
OT
97
0
0
07 Jun 2024
AdvCat: Domain-Agnostic Robustness Assessment for Cybersecurity-Critical
  Applications with Categorical Inputs
AdvCat: Domain-Agnostic Robustness Assessment for Cybersecurity-Critical Applications with Categorical Inputs
Helene Orsini
Hongyan Bao
Yujun Zhou
Xiangrui Xu
Yufei Han
Longyang Yi
Wei Wang
Xin Gao
Xiangliang Zhang
AAML
44
1
0
13 Dec 2022
Online Nonsubmodular Minimization with Delayed Costs: From Full
  Information to Bandit Feedback
Online Nonsubmodular Minimization with Delayed Costs: From Full Information to Bandit Feedback
Tianyi Lin
Aldo Pacchiano
Yaodong Yu
Michael I. Jordan
29
0
0
15 May 2022
Non-submodular Function Maximization subject to a Matroid Constraint,
  with Applications
Non-submodular Function Maximization subject to a Matroid Constraint, with Applications
Khashayar Gatmiry
Manuel Gomez Rodriguez
32
7
0
19 Nov 2018
Determinantal point processes for machine learning
Determinantal point processes for machine learning
Alex Kulesza
B. Taskar
176
1,125
0
25 Jul 2012
1