AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

Reducing Contextual Stochastic Bilevel Optimization via Structured Function Approximation

Maxime Bouscary, Jiawei Zhang, Saurabh Amin

ICLR 2026 · Optimization › Nonconvex and smooth optimization · approach: Penalty and implicit-gradient bilevel methods · 1 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
replace stocBiO partitioning with basis-function reductionstocBiO · Inverse optimizationN for within 3% gap: N=50 -> N = 5Improved
use Chebyshev or Fourier basis instead of stocBiOstocBiO[N] · Inverse optimizationN for smallest loss: N >= 100 -> N >= 10Improved
use more expressive Chebyshev/Fourier basis instead of monomialreduction R_Phi · Inverse optimizationlower-level errorImproved
use Chebyshev basis N=5 in hyperparameter optimization vs stocBiOstocBiO[N] · Hyperparameter optimization (MNIST)validation lossImproved
add more Chebyshev basis functions beyond 5 (ablation)R_Chebyshev · Hyperparameter optimization (MNIST)validation lossNo clear effect
use larger N in stocBiO (ablation)stocBiO[N] · Hyperparameter optimization (MNIST)validation lossMixed
use monomial instead of Chebyshev basis at large N (ablation)R_Phi · Hyperparameter optimization (MNIST)validation lossHurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy