{"data":{"id":"ac6abf76-46cf-45f2-a0e5-c62ff5ea7ee8","title":"\nThe Sample Complexity of Parameter-Free Stochastic Convex Optimization\n","summary":"The authors study the sample complexity of stochastic convex optimization when parameters such as the distance to optimality and the Lipschitz constant are unknown. They propose a reliable model selection method that tunes learning rates to match known-parameter sample complexity up to $\\log\\log$ factors, and a regularization-based method using norm-regularized empirical risk minimization that estimates the distance to optimality within a constant factor. Few-shot experiments on CIFAR-10 with fine-tuned CLIP models and prompt-engineered Gemini shape counting indicate the model selection method can help mitigate overfitting to small validation sets.","solution":"N/A -- no mitigation discussed in source.","labels":["research"],"sourceUrl":"\nhttp://jmlr.org/papers/v27/25-2383.html\n","publishedAt":"2026-01-01T00:00:00.000Z","cveId":null,"cweIds":null,"cvssScore":null,"cvssSeverity":null,"severity":"info","attackType":[],"issueType":"research","affectedPackages":null,"affectedPackageNames":null,"affectedPackageRefs":null,"affectedVendors":[],"affectedVendorsRaw":["CLIP","Gemini"],"classifierModel":"claude-haiku-5-5","classifierPromptVersion":"v4","summaryPromptVersion":"v2","headline":null,"headlinePromptVersion":null,"cvssVector":null,"attackVector":null,"attackComplexity":null,"privilegesRequired":null,"userInteraction":null,"exploitMaturity":null,"epssScore":null,"epssCheckedAt":null,"kevDateAdded":null,"advisoryAliases":null,"affectedPackagesSource":null,"affectedPackagesCheckedAt":null,"patchAvailable":null,"disclosureDate":"2026-01-01T00:00:00.000Z","fixReleasedAt":null,"daysToFix":null,"fixCheckedAt":null,"capecIds":null,"crossRefCount":0,"attackSophistication":"moderate","impactType":null,"aiComponentTargeted":null,"llmSpecific":false,"classifierConfidence":0.6,"researchCategory":"peer_reviewed","atlasIds":null}}