Fast Rank-1 Lattice Targeted Sampling for Black-box Optimization
Yueming Lyu
2/12/2026
No confident code implementation found for this paper. 1 possible match can be shown below.
Code Implementations
No confident code match yet
We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.
No code implementations found yet.
Know of an implementation? Let us know in the comments below!
Similar Papers
Adaptive Stochastic Gradient Algorithm for Black-box Multi-Objective Learning
94% match2026
Model Shapley: Equitable Model Valuation with Black-box Access
89% match1 repo32026
Natural Perturbations for Black-box Training of Neural Networks by Zeroth-Order Optimization
89% match2026
Towards AutoAI: Optimizing a Machine Learning System with Black-box and Differentiable Components
88% match2026
Projective Proximal Gradient Descent for Nonconvex Nonsmooth Optimization: Fast Convergence Without Kurdyka-Lojasiewicz (KL) Property
76% match2026
ParamΔ for Direct Mixing: Post-Train Large Language Model At Zero Cost
76% match2026
Cite this paper
@article{lyu2026fast,
title = {Fast Rank-1 Lattice Targeted Sampling for Black-box Optimization},
author = {Yueming Lyu},
year = {2026},
doi = {10.52202/075280-0461},
url = {https://doi.org/10.52202/075280-0461},
journal = {NEURIPS 2023 2023}
}Add a badge to your README
Shows whether official code is linked for this paper.
[](https://codeofpaper.com/paper/44c4b3ebfe4ce983bc88caf35b6148ad23fcab3c)