68q25

Documents about 68q25

• Computing $k$-means in mixed precision#152991arXiv (OAI)
• The General Position Problem: A Survey#611282arXiv (OAI Expanded)
• The General Position Problem: A Survey#612759arXiv (All)
• Answering Related Questions#158659arXiv (OAI)
• Improved Gradient Descent Lower Bounds Beyond Nesterov#926988arXiv (All)
• Constrained minimax approximation for quantum signal processing#808987arXiv (OAI Expanded)
• Constrained minimax approximation for quantum signal processing#818979arXiv (All)
• The framework to unify all complexity dichotomy theorems for Boolean tensor networks#987609arXiv (All)
• Silver Rate Is (Almost) Optimal for Gradient Descent#999317arXiv (All)
• Approximate Functional Dependencies---Implication Problem Revisited#622877arXiv (OAI Expanded)
• ADMM Fails to Achieve an $O(K^{-1})$ Ergodic KKT Residual Bound#622911arXiv (OAI Expanded)
• Approximate Functional Dependencies---Implication Problem Revisited#625150arXiv (All)
• ADMM Fails to Achieve an $O(K^{-1})$ Ergodic KKT Residual Bound#625184arXiv (All)
• Reduction of the group isomorphism problem to the group automorphism problem#984832arXiv (All)
• Structural Packing and Dyadic Factorization of Sparse Positive Definite Matrices#797190arXiv (OAI Expanded)
• Structural Packing and Dyadic Factorization of Sparse Positive Definite Matrices#798603arXiv (All)
• Class-Based Heuristic Selection for Solving the Flying Block Puzzle#779419arXiv (OAI Expanded)
• Class-Based Heuristic Selection for Solving the Flying Block Puzzle#780794arXiv (All)
• Polynomial-time isomorphism test for solvable groups with abelian Sylow subgroups#985104arXiv (All)
• Mirror Descent Linearized Augmented Lagrangian Methods for Nonconvex Constrained Stochastic Zeroth-Order Optimization#789418arXiv (OAI Expanded)
• Mirror Descent Linearized Augmented Lagrangian Methods for Nonconvex Constrained Stochastic Zeroth-Order Optimization#793422arXiv (All)
• Resident fitness computation in linear time and other algorithmic aspects of interacting trajectories#141700arXiv (OAI)
• An optimal first-order method for smooth and strongly convex composite optimization and its stationary limit#664273arXiv (OAI Expanded)
• An optimal first-order method for smooth and strongly convex composite optimization and its stationary limit#665773arXiv (All)
• Proof-Carrying Analytic Approximation: Local-to-Global Evidence Transport at Encoding Cost#799867arXiv (All)
• On the Instance Optimality of Bidirectional Dijkstra's Algorithm#820644arXiv (All)
• EFX Allocations for Three Agents and Seven or Eight Chores#997591arXiv (All)
• On the resolution of $\ell_1$-norm minimization via a two-metric adaptive projection method#144274arXiv (OAI)
• Revisiting average case complexity of multilevel syllogistic#972447arXiv (All)
• Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor#998825arXiv (All)
• Extending Exact Integrality Gap Computations for the Metric TSP#986210arXiv (All)
• Stochastic Dynamical Low-Rank Approximation in the Context of Machine Learning#253419edoc-Server
• The Art of Calling the Winner by Asking Just Enough Questions: Competitive Preference Elicitation with Next-Best Queries#789306arXiv (OAI Expanded)
• The Art of Calling the Winner by Asking Just Enough Questions: Competitive Preference Elicitation with Next-Best Queries#793310arXiv (All)