Search Results - Machine learning Computational learning theory. Submodular functions. Combinatorial optimization.*

Greedy Guarantees for Non-submodular Function Maximization Under Independent System Constraint with Applications.

Authors: Shi, Majun Yang, Zishen Wang, Wei

Source: Journal of Optimization Theory & Applications. Feb2023, Vol. 196 Issue 2, p516-543. 28p.

Subject Terms: *OPERATIONS research, *COMBINATORIAL optimization, *GREEDY algorithms, *MACHINE learning, *INDEPENDENT sets, *MATHEMATICAL economics

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

Applications of submodular minimization in machine learning

Authors: Narasimhan, Mukund

Source: Connect to this title online; UW restricted.

Subject Terms: Machine learning Computational learning theory. Submodular functions. Combinatorial optimization.

Availability: http://hdl.handle.net/1773/5983

Hypergraph Cuts with General Splitting Functions.

Authors: Veldt, Nate Benson, Austin R. Kleinberg, Jon

Source: SIAM Review; 2022, Vol. 64 Issue 3, p650-685, 36p

Subject Terms: CUTTING stock problem, COMPUTATIONAL mathematics, OPERATIONS research, SUBMODULAR functions, COMBINATORIAL optimization, HYPERGRAPHS

Constraint generation approaches for submodular function maximization leveraging graph properties.

Authors: Csókás, Eszter Vinkó, Tamás

Source: Journal of Global Optimization; Feb2024, Vol. 88 Issue 2, p377-394, 18p

Subject Terms: SUBMODULAR functions, COMBINATORIAL optimization, INTEGER programming, EXPECTATION-maximization algorithms

Submodular functions: from discrete to continuous domains

Authors: Bach, Francis

Contributors: Bach, Francis

Source: Mathematical Programming. 175:419-459

Subject Terms: FOS: Computer and information sciences, Computer Science - Machine Learning, Optimization and Control (math.OC), FOS: Mathematics, [MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC], [INFO.INFO-LG] Computer Science [cs]/Machine Learning [cs.LG], Mathematics - Optimization and Control, Machine Learning (cs.LG)

File Description: application/pdf

Access URL: https://hal.archives-ouvertes.fr/hal-01222319v2/file/continuous_submodular_v2.pdf
http://arxiv.org/abs/1511.00394
https://link.springer.com/article/10.1007/s10107-018-1248-6
https://www.archives-ouvertes.fr/hal-01222319v1
https://www.scilit.net/article/998c3452ff1c7ed126edf3e71028089d
http://ui.adsabs.harvard.edu/abs/2015arXiv151100394B/abstract
https://dblp.uni-trier.de/db/journals/corr/corr1511.html#Bach15a
https://arxiv.org/pdf/1511.00394.pdf

Submodular functions: from discrete to continuous domains.

Authors: Bach, Francis

Source: Mathematical Programming; May2019, Vol. 175 Issue 1/2, p419-459, 41p

Subject Terms: SUBMODULAR functions, COMBINATORIAL optimization, PROBABILITY theory, MATHEMATICAL optimization, DERIVATIVES (Mathematics)

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

Structured Robust Submodular Maximization: Offline and Online Algorithms.

Authors: Torrico, Alfredo Singh, Mohit Pokutta, Sebastian et al.

Source: INFORMS Journal on Computing; 2021, Vol. 33 Issue 4, p1590-1607, 18p

Subject Terms: SUBMODULAR functions, ONLINE algorithms, COMBINATORIAL optimization, ALGORITHMS, OPERATIONS research, SUBSET selection

A heuristic search based on diversity for solving combinatorial problems.

Authors: Casas, Francisco Torres, Claudio E. Araya, Ignacio

Source: Journal of Heuristics; Jun2022, Vol. 28 Issue 3, p287-328, 42p

Subject Terms: HEURISTIC, PROBLEM solving, INDUSTRIAL location, COMBINATORIAL optimization, SUBMODULAR functions, METAHEURISTIC algorithms, INTUITION

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

Maximizing k-submodular functions under budget constraint: applications and streaming algorithms.

Authors: Pham, Canh V. Vu, Quang C. Ha, Dung K. T. et al.

Source: Journal of Combinatorial Optimization; Aug2022, Vol. 44 Issue 1, p723-751, 29p

Submodular Functions: from Discrete to Continous Domains

Authors: Bach, Francis

Index Terms: Computer Science - Machine Learning, Mathematics - Optimization and Control, text

URL: http://arxiv.org/abs/1511.00394

Parallel Quasi-concave set optimization: A new frontier that scales without needing submodularity

Authors: Vepakomma, Praneeth Kempner, Yulia Raskar, Ramesh

Index Terms: Mathematics - Optimization and Control, Computer Science - Distributed, Parallel, and Cluster Computing, Mathematics - Combinatorics, Statistics - Machine Learning, text

URL: http://arxiv.org/abs/2108.08758

Semisupervised SVM Batch Mode Active Learning with Applications to Image Retrieval.

Authors: HOI, STEVEN C. H. RONG JIN JIANKE ZHU et al.

Source: ACM Transactions on Information Systems; May2009, Vol. 27 Issue 3, p16:1-16:29, 29p, 1 Black and White Photograph, 10 Charts, 3 Graphs

Subject Terms: SUPPORT vector machines, SUPERVISED learning, KERNEL functions, INFORMATION retrieval, IMAGE storage & retrieval systems, IMAGE retrieval

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)

A Differentially Private Approximation Algorithm for Submodular Maximization Under a Polymatroid Constraint Over the Integer Lattice.

Authors: Hu, Jiaming Hao, Chunlin Miao, Cuixia et al.

Source: International Journal of Foundations of Computer Science; Aug2025, Vol. 36 Issue 5, p649-666, 18p

Subject Terms: PRIVACY, SUBMODULAR functions, LATTICE theory, ALGORITHMS, GREEDY algorithms, MATHEMATICAL optimization

Algorithms for Cardinality-Constrained Monotone DR-Submodular Maximization with Low Adaptivity and Query Complexity.

Authors: Gong, Suning Nong, Qingqin Fang, Jiazhu et al.

Source: Journal of Optimization Theory & Applications; Jan2024, Vol. 200 Issue 1, p194-214, 21p

Subject Terms: APPROXIMATION algorithms, COMBINATORIAL optimization, DATA mining, MACHINE learning