Search Results for author:
Found 5 papers, 1 papers with code
Softmax Probabilities (Mostly) Predict Large Language Model Correctness on Multiple-Choice Q&A
Although large language models (LLMs) perform impressively on many tasks, overconfidence remains a problem.
Avoiding Catastrophe in Continuous Spaces by Asking for Help
Specifically, we assume that the payoff each round represents the chance of avoiding catastrophe that round, and try to maximize the product of payoffs (the overall chance of avoiding catastrophe).
Robust Learning for Congestion-Aware Routing
We consider the problem of routing users through a network with unknown congestion functions over an infinite time horizon.
Position-Indexed Formulations for Kidney Exchange
The recent introduction of chains, where a donor without a paired patient triggers a sequence of donations without requiring a kidney in return, increased the efficacy of fielded kidney exchanges---while also dramatically raising the empirical computational hardness of clearing the market in practice.
Hardness of the Pricing Problem for Chains in Barter Exchanges
One of the leading techniques has been branch and price, where column generation is used to incrementally bring cycles and chains into the optimization model on an as-needed basis.
