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. 2201.00703
  4. Cited By
Stochastic Continuous Submodular Maximization: Boosting via
  Non-oblivious Function
v1v2v3 (latest)

Stochastic Continuous Submodular Maximization: Boosting via Non-oblivious Function

3 January 2022
Qixin Zhang
Zengde Deng
Zaiyi Chen
Haoyuan Hu
Yu Yang
ArXiv (abs)PDFHTML

Papers citing "Stochastic Continuous Submodular Maximization: Boosting via Non-oblivious Function"

4 / 4 papers shown
Title
RankFlow: A Multi-Role Collaborative Reranking Workflow Utilizing Large Language Models
RankFlow: A Multi-Role Collaborative Reranking Workflow Utilizing Large Language Models
Can Jin
Hongwu Peng
Anxiang Zhang
Nuo Chen
Jiahui Zhao
...
Keqin Li
Shuya Feng
Kai Zhong
Caiwen Ding
Dimitris N. Metaxas
242
2
0
02 Feb 2025
Decentralized Projection-free Online Upper-Linearizable Optimization with Applications to DR-Submodular Optimization
Decentralized Projection-free Online Upper-Linearizable Optimization with Applications to DR-Submodular Optimization
Yiyang Lu
M. Pedramfar
Vaneet Aggarwal
140
0
0
30 Jan 2025
Stochastic Submodular Maximization via Polynomial Estimators
Stochastic Submodular Maximization via Polynomial Estimators
Gözde Özcan
Stratis Ioannidis
47
1
0
17 Mar 2023
Online Learning for Non-monotone Submodular Maximization: From Full
  Information to Bandit Feedback
Online Learning for Non-monotone Submodular Maximization: From Full Information to Bandit Feedback
Qixin Zhang
Zengde Deng
Zaiyi Chen
Kuangqi Zhou
Haoyuan Hu
Yu Yang
74
6
0
16 Aug 2022
1