Results 1 to 10 of about 8,892,749 (345)
Hard Prompts Made Easy: Gradient-Based Discrete Optimization for Prompt Tuning and Discovery [PDF]
The strength of modern generative models lies in their ability to be controlled through text-based prompts. Typical"hard"prompts are made from interpretable words and tokens, and must be hand-crafted by humans.
Yuxin Wen +5 more
semanticscholar +1 more source
Automatically Auditing Large Language Models via Discrete Optimization [PDF]
Auditing large language models for unexpected behaviors is critical to preempt catastrophic deployments, yet remains challenging. In this work, we cast auditing as an optimization problem, where we automatically search for input-output pairs that match a
Erik Jones +3 more
semanticscholar +1 more source
The Sample Average Approximation Method for Stochastic Discrete Optimization
Anton Kleywegt +2 more
exaly +2 more sources
Decision Diagrams for Discrete Optimization: A Survey of Recent Advances [PDF]
In the last decade, decision diagrams (DDs) have been the basis for a large array of novel approaches for modeling and solving optimization problems.
Margarita P. Castro +2 more
semanticscholar +1 more source
Presolving linear bilevel optimization problems
Linear bilevel optimization problems are known to be strongly NP-hard and the computational techniques to solve these problems are often motivated by techniques from single-level mixed-integer optimization.
Thomas Kleinert +3 more
doaj +1 more source
Tropical Oriented Matroids [PDF]
Tropical oriented matroids were defined by Ardila and Develin in 2007. They are a tropical analogue of classical oriented matroids in the sense that they encode the properties of the types of points in an arrangement of tropical hyperplanes – in much the
Silke Horn
doaj +1 more source
Surrogate-assisted optimization has attracted much attention due to its superiority in solving expensive optimization problems. However, relatively little work has been dedicated to addressing expensive constrained multi-objective discrete optimization ...
Qing-Hua Gu +4 more
semanticscholar +1 more source
Adaptive Cut Selection in Mixed-Integer Linear Programming
Cutting plane selection is a subroutine used in all modern mixed-integer linear programming solvers with the goal of selecting a subset of generated cuts that induce optimal solver performance.
Turner, Mark +3 more
doaj +1 more source
Discrete Optimization for Shape Matching
We propose a novel discrete solver for optimizing functional map‐based energies, including descriptor preservation and promoting structural properties such as area‐preservation, bijectivity and Laplacian commutativity among others.
Jing Ren +3 more
semanticscholar +1 more source
Progress in mathematical programming solvers from 2001 to 2020
This study investigates the progress made in lp and milp solver performance during the last two decades by comparing the solver software from the beginning of the millennium with the codes available today.
Thorsten Koch +3 more
doaj +1 more source

