Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

233466699932 · Jun 202019922001200920172026
48 results for optimal levels

BILBO optimizes bilevel problems without repeated lower-level optimizations.

problem Challenges in bilevel optimization, especially in noisy, constrained, and derivative-free settings.
method BILevel Bayesian Optimization (BILBO) that optimizes both levels simultaneously, using confidence-bounds and function query selection.
result Theoretical and empirical evidence of BILBO's effectiveness on various problems.

Novel method for bilevel optimization with convex lower-level problem.

problem Minimizing a smooth objective over the optimal solution set of a convex constrained problem.
method Local cutting plane approximation of lower-level solution set combined with conditional gradient updates.
result Achieves optimal iteration complexity for the considered class of bilevel problems.

Paper explores generalization of AID-based bi-level optimization methods.

problem Uncertainty in generalization properties of AID-based bi-level optimization methods.
method Uniform stability analysis and convergence study of AID-based methods.
result AID-based methods can achieve similar generalization as single-level nonconvex problems.

Paper tackles efficient SGD methods for constrained bilevel optimization.

problem Stochastic bilevel optimization with equality constraints.
method Alternating implicit projected SGD and its variants.
result Achieves sample complexity matching state-of-the-art for unconstrained problems.

This paper analyzes user-level local differential privacy in distributed systems.

problem The relationship between user-level and item-level local differential privacy under the local model is complex.
method The paper analyzes the mean estimation problem and applies it to stochastic optimization, classification, and regression. It proposes adaptive strategies to achieve optimal performance at all privacy levels.
result The proposed methods are minimax optimal up to logarithmic factors and show that user-level DP can lead to faster convergence rates than item-level DP.

New algorithm optimizes adaptive return level for Markowitz portfolios.

problem Finding an optimal return level for Markowitz portfolios when investor's risk appetite is unknown.
method Krasnoselskii-Mann Proximity Algorithm based on proximity operator and momentum technique.
result Significant improvements over state-of-the-art methods in portfolio optimization.

A new algorithm improves Wasserstein discriminant analysis for better data classification.

problem Improving data classification in machine learning.
method Bi-level nonlinear eigenvector algorithm (WDA-nepv) for optimal transport and trace ratio optimizations.
result WDA-nepv enhances classification accuracy and scalability.

New method achieves optimal sample complexity without warm-start in bilevel optimization.

problem Optimizing smooth objective functions with fixed point constraints in meta-learning and equilibrium models.
method Fixed point iterations at lower-level and projected inexact gradient descent at upper-level.
result Achieves near optimal sample complexity O(ε2)O(ε^{-2}) and ildeO(ε1) ilde{O}(ε^{-1}) samples.

Study optimal retirement time and consumption with habitual persistence.

problem Understanding retirement consumption patterns with habitual persistence.
method Established concise habitual evolution, used martingale and duality methods.
result Optimal consumption declines sharply at retirement but excess consumption increases.

New methods solve complex optimization problems without strong convexity assumptions.

problem Complex bilevel optimization problems with minimax lower-level structures.
method Penalty-based first-order methods for bilevel minimax optimization.
result Achieves εε-KKT point with improved oracle complexity.

This paper optimizes predicting support and resistance levels in financial markets.

problem Optimizing prediction of resistance and support levels in financial markets.
method Assuming a constant elasticity of variance process, the paper derives optimal trading boundaries using the aspiration level hypothesis.
result Optimal trading boundaries serve as predictors of resistance and support levels, located relative to the median interval of the hidden aspiration level.

New algorithm tackles nested bi-level optimization problems for robust feature learning.

problem Nested compositional bi-level optimization problems in machine learning.
method Stochastic approximation algorithms for solving nested compositional bi-level optimization problems without matrix inversions.
result Achieves an ε-stationary solution with an oracle complexity of approximately O_T(1/ε^2).

New methods solve complex optimization problems in machine learning.

problem Challenges in stochastic bilevel optimization with constraints and high variables.
method Inexact bilevel stochastic gradient methods for constrained and unconstrained lower-level problems.
result Comprehensive convergence theory for both unconstrained and constrained cases.

New methods optimize complex optimization problems with improved efficiency.

problem Optimizing complex problems with a convex lower-level objective.
method Uses stochastic cutting planes and conditional gradient updates.
result Improves complexity for both convex and non-convex upper-level functions.

SUSTAIN algorithm tackles stochastic bilevel optimization with near-optimal complexity.

problem Stochastic bilevel optimization problems with specific convexity and smoothness properties.
method SUSTAIN algorithm using single-timescale double-momentum stochastic approximation.
result SUSTAIN achieves near-optimal complexity for finding ε-stationary solutions.

A method for fair representation learning through bi-level optimization and implicit differentiation.

problem Ensuring fair predictors invariant across sub-groups.
method Bi-level optimization with inner-loop for invariant predictors, implicit path alignment for efficiency.
result Consistently better trade-off in prediction performance and fairness measurement.

New method uses bi-level optimization to learn useful representations for imitation learning.

problem Learning useful representations for multiple tasks in imitation learning settings.
method Formulates representation learning as a bi-level optimization problem.
result Bi-level optimization framework provides sample complexity benefits for imitation learning.

In a financial market model, we consider variations of the problem of minimizing the expected time to upcross a certain wealth level. For exponential Levy markets, we show the asymptotic optimality of the growth-optimal portfolio for the above problem and obtain tight bounds for the value function for any wealth level.…

2009-04-13abs ↗pdf ↗

New algorithms solve complex multi-level optimization problems with improved efficiency.

problem Smooth stochastic multi-level composition optimization problems.
method Two algorithms using moving-average and linearized stochastic estimates.
result Achieved sample complexities of O(1/ε^4) and O(1/ε^6).

Optimizes query routing to LLMs under cost and resource constraints.

problem Non-uniform or adversarial batching in per-query routing methods leads to cost inefficiency.
method Batch-level, resource-aware routing framework that jointly optimizes model assignment for each batch.
result Robust routing framework improves accuracy by 1-14% over non-robust methods.

Study optimal ridge regularization for out-of-distribution prediction.

problem Optimal ridge regularization for predicting out-of-distribution data.
method Established conditions for optimal regularization under covariate and regression shifts, proving monotonic risk in data aspect ratio.
result Negative regularization can be optimal under shifts, even with isotropic or underparameterized training features.

New method solves complex optimization problems faster.

problem Minimizing a convex smooth objective over the optimal solution set of another convex smooth problem.
method Uses a cutting plane approach to approximate the lower-level problem and an accelerated gradient method to update the upper-level objective.
result Shows that the method requires at most O(max{1/εf,1/εg})\mathcal{O}(\max\{1/\sqrt{ε_{f}}, 1/ε_g\}) iterations to achieve εfε_f-suboptimality and εgε_g-infeasibility.

Trajectory-level supervision allows efficient offline reinforcement learning.

problem Offline reinforcement learning
method Developing a statistical theory for offline policy optimization from trajectory-level labels
result Proving a high-probability guarantee of order O~(H2Csa(π)/n)\widetilde O(H^2\sqrt{C_{sa}(\pi^\star)/n})

Optimal gradient quantization reduces communication costs in distributed deep learning.

problem High communication costs in distributed training of deep neural networks.
method Deduced optimal gradient quantization conditions for binary and multi-level quantization, developed novel schemes for dynamic quantization levels.
result Demonstrated superior performance of proposed quantization schemes on CIFAR and ImageNet datasets.

An important linear algebra routine, GEneral Matrix Multiplication (GEMM), is a fundamental operator in deep learning. Compilers need to translate these routines into low-level code optimized for specific hardware. Compiler-level optimization of GEMM has significant performance impact on training and executing deep lea…

2019-09-23abs ↗pdf ↗

MiLeNAS improves neural architecture search by reducing approximation errors and achieving better accuracy.

problem Improving efficiency and accuracy in neural architecture search (NAS).
method Mixed-level reformulation (MiLeNAS) to optimize efficiently and reliably.
result MiLeNAS achieves lower validation error and higher accuracy than bilevel optimization methods.

Paper proposes SMO for solving bilevel optimization problems efficiently.

problem Solving bilevel optimization problems with nonsmooth convex lower-level and nonconvex upper-level objectives.
method Sequential minimax optimization (SMO) method using modified augmented Lagrangian and penalty schemes.
result Improves operation complexity for finding ε\varepsilon-KKT solutions.

New method tackles inexact bilevel optimization for faster parameter learning.

problem Nested optimization problems in bilevel learning with computationally difficult exact solutions.
method Inexact derivative-free optimization algorithms for approximate lower-level solutions.
result Global convergence and worst-case complexity for the proposed approach.

BiDVL improves EBLVMs for visual tasks by optimizing two variational distributions.

problem Training EBLVMs is challenging due to intractable distributions.
method Bi-level doubly variational learning with two tractable distributions.
result BiDVL achieves impressive image generation and reconstruction performance.

A new stochastic method tackles bi-level optimization problems in deep learning.

problem Bi-level optimization problems in deep learning, including hyperparameter optimization and meta learning.
method Turning a BLO problem into a stochastic optimization, using SGLD MCMC and a recurrent algorithm to compute MC-estimated hypergradient.
result Our method is more robust to suboptimal inner optimization and non-unique inner minima, leading to more reliable solutions.

Proposes methods for online conformal prediction with nested prediction sets across multiple confidence levels.

problem Need for uncertainty quantification with multiple confidence levels in diverse applications.
method Online optimization perspective to enforce nestedness of prediction sets while controlling quantile estimation error.
result Achieves stable coverage across all levels, strictly nested prediction sets, and improved efficiency.

Estimates population mean from user-level data with privacy, accounting for heterogeneity.

problem Heterogeneous user data with varying numbers of data points and distributions.
method Simple model of heterogeneous user data, differential privacy mechanism for estimation.
result Asymptotic optimality of the proposed estimator and general lower bounds on error.

Time changes of noise level at Warsaw Stock Market are analyzed using a recently developed method basing on properties of the coarse grained entropy. The condition of the minimal noise level is used to build an efficient portfolio. Our noise level approach seems to be a much better tool for risk estimations than standa…

2005-03-31abs ↗pdf ↗