Adaptive submodularity: theory and applications in active learning and stochastic optimization
From MaRDI portal
Recommendations
Cited in
(92)- Decision trees for function evaluation: simultaneous optimization of worst and expected cost
- Submodular goal value of Boolean functions
- Stochastic block-coordinate gradient projection algorithms for submodular maximization
- Robust monotone submodular function maximization
- Robust budget allocation via continuous submodular functions
- Discount allocation for cost minimization in online social networks
- Adaptive robust submodular optimization and beyond
- The stochastic Boolean function evaluation problem for symmetric Boolean functions
- Adaptive influence maximization under fixed observation time-step
- Beyond pointwise submodularity: non-monotone adaptive submodular maximization subject to knapsack and \(k\)-system constraints
- Streaming algorithms for monotone non-submodular function maximization under a knapsack constraint on the integer lattice
- Partial-monotone adaptive submodular maximization
- Two approximation algorithms for maximizing nonnegative weakly monotonic set functions
- Adaptive seeding for profit maximization in social networks
- Maximization of monotone non-submodular functions with a knapsack constraint over the integer lattice
- Fixed observation time-step: adaptive influence maximization
- Submodular optimization problems and greedy strategies: a survey
- Beyond pointwise submodularity: non-monotone adaptive submodular maximization in linear time
- A unifying look at sequence submodularity
- Dynamic competition over social networks
- SALSAS: sub-linear active learning strategy with approximate \(k\)-NN search
- Price of dependence: stochastic submodular maximization with dependent items
- Influence maximization with partial feedback
- Non-submodular maximization on massive data streams
- Informative path planning as a maximum traveling salesman problem with submodular rewards
- Decision tree classification with bounded number of errors
- Annotation cost-sensitive active learning by tree sampling
- Stochastic-lazier-greedy algorithm for monotone non-submodular maximization
- Streaming adaptive submodular maximization
- Group fairness in non-monotone submodular maximization
- Discrete stochastic submodular maximization: adaptive vs. non-adaptive vs. offline
- Distributed submodular maximization
- Scenario submodular cover
- Robust monotone submodular function maximization
- Submodular stochastic probing on matroids
- Ignorant vs. anonymous recommendations
- Adaptive rumor spreading
- Interactive algorithms: pool, stream and precognitive stream
- Locally Adaptive Optimization: Adaptive Seeding for Monotone Submodular Functions
- scientific article; zbMATH DE number 6999915 (Why is no real title available?)
- On Monte-Carlo tree search for deterministic games with alternate moves and complete information
- Learning to optimize via information-directed sampling
- The stochastic score classification problem
- A Tight Bound for Stochastic Submodular Cover
- scientific article; zbMATH DE number 7387623 (Why is no real title available?)
- Robust Adaptive Submodular Maximization
- Measuring the impact of MVC attack in large complex networks
- Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
- Seeding with costly network information
- Adaptive submodular ranking and routing
- Approximation algorithms for stochastic k-TSP
- Evaluation of monotone DNF formulas
- Submodular maximization with uncertain knapsack capacity
- Time bounded adaptive information coverage in social networks
- Sequence submodular maximization meets streaming
- Stochastic submodular probing with state-dependent costs
- Stochastic submodular probing with state-dependent costs
- Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint
- Novel algorithms for maximum DS decomposition
- Parallelized maximization of nonsubmodular function subject to a cardinality constraint
- On competitive recommendations
- Uncertainty in Study of Social Networks: Robust Optimization and Machine Learning
- A single factor approximation ratio algorithm for DR-submodular maximization on integer lattice beyond non-negativity and monotonicity
- Better bounds on the adaptivity gap of influence maximization under full-adoption feedback
- Streaming adaptive submodular maximization
- Constrained stochastic submodular maximization with state-dependent costs
- Partial-adaptive submodular maximization
- Stochastic Probing with Increasing Precision
- Math‐based reinforcement learning for the adaptive budgeted influence maximization problem
- Adaptivity gap for influence maximization with linear threshold model on trees
- Streaming algorithms for non-submodular functions maximization with \(d\)-knapsack constraint on the Integer lattice
- Finding the optimal exploration-exploitation trade-off online through Bayesian risk estimation and minimization
- Approximating decision trees with priority hypotheses
- Maximizing stochastic set function under a matroid constraint from decomposition
- Beyond pointwise submodularity: non-monotone adaptive submodular maximization subject to knapsack and \(k\)-system constraints
- Approximating decision trees with priority hypotheses
- Influence maximization independent of seed set size
- Achieving long-term fairness in submodular maximization through randomization
- Targeting influence in a harmonic opinion model
- Deletion robust non-monotone submodular maximization over matroids
- Correlated stochastic knapsack with a submodular objective
- Maximizing the ratio of monotone DR-submodular functions on integer lattice
- A finite-horizon approach to active level set estimation
- Sequential decision based learning method for influence maximization
- Practical parallel algorithms for non-monotone submodular maximization
- Adaptive combinatorial maximization: beyond approximate greedy policies
- Fully dynamic submodular maximization over matroids
- The one-way communication complexity of submodular maximization with applications to streaming and robustness
- Improved approximation factor for adaptive influence maximization via simple greedy strategies
- Opinion dynamics with median aggregation
- Vantage point selection algorithms for bottleneck capacity estimation
- Submodularity and greedy algorithms in sensor scheduling for linear dynamical systems
This page was built for publication: Adaptive submodularity: theory and applications in active learning and stochastic optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3112637)
