Search Results - machinery learning computational learning theory. submodular functions. combinatorial optimization.

Learning with Submodular Functions: A Convex Optimization Perspective.

Authors: Bach, Francis

Source: Foundations & Trends in Machine Learning; 2013, Vol. 6 Issue 2/3, p145-373, 233p

Subject Terms: SUBMODULAR functions, MACHINE learning, MATHEMATICAL optimization, MATHEMATICAL regularization, COMBINATORIAL optimization, ALGORITHMS

Minimization Problems with Non-Submodular Cover Constraint.

Authors: Wang, Wenqi Liu, Zhicheng Du, Donglei et al.

Source: Asia-Pacific Journal of Operational Research; Oct2023, Vol. 40 Issue 5, p1-19, 19p

Subject Terms: SUBMODULAR functions, APPROXIMATION algorithms, COMBINATORIAL optimization, GREEDY algorithms

Sequential Submodular Maximization and Applications to Ranking an Assortment of Products.

Authors: Asadpour, Arash Niazadeh, Rad Saberi, Amin et al.

Source: Operations Research; Jul/Aug2023, Vol. 71 Issue 4, p1154-1170, 17p

Subject Terms: SUBMODULAR functions, ELECTRONIC commerce, MATROIDS, COMBINATORIAL optimization, POLYTOPES

Learning with Submodular Functions : A Convex Optimization Perspective

Authors: Francis Bach

Resource Type: eBook.

Categories: COMPUTERS / Machine Theory

A Test Score-Based Approach to Stochastic Submodular Optimization.

Authors: Sekar, Shreyas Vojnovic, Milan Yun, Se-Young

Source: Management Science; Feb2021, Vol. 67 Issue 2, p1075-1092, 18p

Subject Terms: SUBMODULAR functions, EXPECTED returns, UTILITY functions, TEST scoring, COMBINATORIAL optimization

Streaming submodular maximization under d-knapsack constraints.

Authors: Chen, Zihan Liu, Bin Du, Hongmin W.

Source: Journal of Combinatorial Optimization; Jan2023, Vol. 45 Issue 1, p1-21, 21p

Quadratic Memory Is Necessary for Optimal Query Complexity in Convex Optimization: Center of Mass Is Pareto Optimal.

Authors: Blanchard, Moïse Zhang, Junhui Jaillet, Patrick

Source: Mathematics of Operations Research; Nov2025, Vol. 50 Issue 4, p2941-2971, 31p

Subject Terms: CONVEX programming, MATHEMATICAL optimization, COMPUTATIONAL complexity, LIPSCHITZ continuity, FEASIBILITY problem (Mathematical optimization), COMMUNICATION complexity (Information theory)

Analyzing greedy vaccine allocation algorithms for metapopulation disease models.

Authors: Keithley, Jeffrey Choudhuri, Akash Adhikari, Bijaya et al.

Source: PLoS Computational Biology; 7/21/2025, Vol. 21 Issue 7, p1-26, 26p

Subject Terms: VACCINATION, GREEDY algorithms, SUBMODULAR functions, PROBLEM solving, EPIDEMICS, METAPOPULATION (Ecology), MATHEMATICAL optimization, VIRAL transmission

Geographic Terms: TEXAS

The Limitations of Optimization from Samples.

Authors: BALKANSKI, ERIC RUBINSTEIN, AVIAD SINGER, YARON

Source: Journal of the ACM; May2022, Vol. 69 Issue 3, p1-33, 33p

Subject Terms: SUBMODULAR functions, CURVATURE

Minimizing Convex Functions with Rational Minimizers.

Authors: JIANG, HAOTIAN

Source: Journal of the ACM; Feb2023, Vol. 70 Issue 1, p1-27, 27p

Subject Terms: SUBMODULAR functions, CONVEX functions, POLYNOMIAL time algorithms, RIESZ spaces, LATTICE theory, CONVEX geometry

Combinatorial Optimization.

Source: Oberwolfach Reports; 2024, Vol. 21 Issue 4, p2949-2999, 51p

Subject Terms: COMBINATORIAL optimization, ALGEBRAIC geometry, OPERATIONS research, APPLIED sciences, GROUP theory

Runtime Analysis of Quality Diversity Algorithms.

Authors: Bossek, Jakob Sudholt, Dirk

Source: Algorithmica; Oct2024, Vol. 86 Issue 10, p3252-3283, 32p

Subject Terms: SUBMODULAR functions, EVOLUTIONARY computation, POLYNOMIAL time algorithms, ALGORITHMS

Practical and Parallelizable Algorithms for Non-Monotone Submodular Maximization with Size Constraint.

Authors: Yixin Chen Kuhnle, Alan

Source: Journal of Artificial Intelligence Research; 2024, Vol. 79, p599-637, 39p

Subject Terms: APPROXIMATION algorithms, PROBABILITY theory, SUBMODULAR functions, MATHEMATICAL analysis, MATHEMATICAL models

On (Random-Order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs.

Authors: MacRury, Calum Ma, Will Grammel, Nathaniel

Source: Operations Research; Mar/Apr2025, Vol. 73 Issue 2, p689-703, 15p

Subject Terms: RANDOM graphs, COMBINATORIAL optimization, REVENUE management, CONSTRAINED optimization, BIPARTITE graphs

Competitive Influence Maximization with Uncertain Competitor Sources and the Bandwagon Effect in Social Networks.

Authors: Sun, Tao Gong, Suning Fan, Guo-Qiang et al.

Source: Asia-Pacific Journal of Operational Research; Oct2024, Vol. 41 Issue 5, p1-26, 26p

Subject Terms: SOCIAL influence, SUBMODULAR functions, SOCIAL networks, GREEDY algorithms, INFORMATION dissemination

Efficient Streaming Algorithms for Maximizing Monotone DR-Submodular Function on the Integer Lattice.

Authors: Nguyen, Bich-Ngan T. Pham, Phuong N. H. Le, Van-Vang et al.

Source: Mathematics (2227-7390); Oct2022, Vol. 10 Issue 20, p3772-N.PAG, 19p

Subject Terms: SUBMODULAR functions, INTEGERS, SENSOR placement, SCIENTIFIC community, ALGORITHMS, BIPARTITE graphs, EXPECTATION-maximization algorithms, FORWARD error correction

Should Only Popular Products Be Stocked? Warehouse Assortment Selection for E-Commerce Companies.

Authors: Li, Xiaobo Lin, Hongyuan Liu, Fang

Source: Manufacturing & Service Operations Management (M&SOM); Jul/Aug2024, Vol. 26 Issue 4, p1372-1386, 15p

Subject Terms: SUBMODULAR functions, COST functions, WAREHOUSES, POLYNOMIAL time algorithms, ELECTRONIC commerce, DYNAMIC programming, WAREHOUSE automation, JOB shops

Geographic Terms: SINGAPORE

A Survey on the Densest Subgraph Problem and its Variants.

Authors: Lanciano, Tommaso Miyauchi, Atsushi Fazzone, Adriano et al.

Source: ACM Computing Surveys; Aug2024, Vol. 56 Issue 8, p1-40, 40p

Subject Terms: COLUMN generation (Algorithms), DISCRETE mathematics, SUBMODULAR functions, MATHEMATICAL programming, BENFORD'S law (Statistics), APPROXIMATION algorithms, DIRECTED graphs, BIPARTITE graphs

Evolutionary Algorithm on General Cover with Theoretically Guaranteed Approximation Ratio.

Authors: Zhang, Yaoyao Zhu, Chaojie Tang, Shaojie et al.

Source: INFORMS Journal on Computing; Mar/Apr2024, Vol. 36 Issue 2, p510-525, 16p

Subject Terms: SUBMODULAR functions, POLYNOMIAL time algorithms, APPROXIMATION algorithms, EVOLUTIONARY algorithms, GREEDY algorithms, DOMINATING set, HEURISTIC

Geographic Terms: ZHEJIANG Sheng (China), CHINA

An optimal streaming algorithm for non-submodular functions maximization on the integer lattice.

Authors: Liu, Bin Chen, Zihan Wang, Huijuan et al.

Source: Journal of Combinatorial Optimization; Jan2023, Vol. 45 Issue 1, p1-17, 17p