Geoff Pleiss, Evan Shelhamer, Tim Zhou
We lifted 2 functions out of this paper's own repositories and ran 2 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| timgzhou/asymmetric-duos | — | 2 of 2 |
| Function | Status | Where it lives |
|---|---|---|
| DuoWrapper | Ran | timgzhou/asymmetric-duos/load_models/DuoWrapper.py pointer only (licence: NONE) · get_code("6bed910ff16503cd") |
| TempScaleWrapper | Ran | timgzhou/asymmetric-duos/load_models/DuoWrapper.py pointer only (licence: NONE) · get_code("180a7bb84255d1aa") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
The go-to strategy to apply deep networks in settings where uncertainty informs decisions-ensembling multiple training runs with random initializations-is illsuited for the extremely large-scale models and practical fine-tuning workflows of today. We introduce a new cost-effective strategy for improving the uncertainty quantification and downstream decisions of a large model (e.g. a fine-tuned ViT-B): coupling it with a less accurate but much smaller "sidekick" (e.g. a fine-tuned ResNet-34) with a fraction of the computational cost. We propose aggregating the predictions of this Asymmetric Duo by simple learned weighted averaging. Surprisingly, despite their inherent asymmetry, the sidekick model almost never harms the performance of the larger model. In fact, across five image classification benchmarks and a variety of model architectures and training schemes (including soups), Asymmetric Duos significantly improve accuracy, uncertainty quantification, and selective classification metrics with only ∼10 -20% more computation. Code is available at https://github.com/timgzhou/asymmetric-duos.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2505.18636")
get_code_for_paper("2505.18636")
have("2505.18636")
Connect an agent — have() is free.