![[2606.03562] Magnet-Free Proton Therapy with 4D Pencil Beam Delivery Optimisation](/static/img/curated/desks/afbytes-tech.png)
[2606.03562] Magnet-Free Proton Therapy with 4D Pencil Beam Delivery Optimisation
Abstract page for arXiv paper 2606.03562: Magnet-Free Proton Therapy with 4D Pencil Beam Delivery Optimisation
America Forever Bytes
optimization · AFBytes
Other
optimization
Recent coverage
[2606.03549] How Many Trees in a Random Forest? A Revisited Approach with Plateau Search and Optuna Integration
Abstract page for arXiv paper 2606.03549: How Many Trees in a Random Forest? A Revisited Approach with Plateau Search and Optuna Integration
[2606.03559] Analytical Evaluation of DCA Convergence Properties for Minimizing Prediction Functions of Gaussian RBF Support Vector Regression
Abstract page for arXiv paper 2606.03559: Analytical Evaluation of DCA Convergence Properties for Minimizing Prediction Functions of Gaussian RBF Support Vector...
[2606.02740] ScoreStop: Gradient-based early stopping using functional score tests
Abstract page for arXiv paper 2606.02740: ScoreStop: Gradient-based early stopping using functional score tests
[2606.03553] A Robust Optimization Approach to Sparse Principal Component Analysis
Abstract page for arXiv paper 2606.03553: A Robust Optimization Approach to Sparse Principal Component Analysis
[2606.03591] Semidefinite Programming Certificates for Synchronization of Kuramoto Oscillators on Arcs
Abstract page for arXiv paper 2606.03591: Semidefinite Programming Certificates for Synchronization of Kuramoto Oscillators on Arcs
[2606.03736] Resource-Constrained Adaptive Inference for Sequential Pricing
Abstract page for arXiv paper 2606.03736: Resource-Constrained Adaptive Inference for Sequential Pricing
[2606.03769] Bregman meets Lévy: Stochastic mirror descent with heavy-tailed noise in continuous and discrete time
Abstract page for arXiv paper 2606.03769: Bregman meets Lévy: Stochastic mirror descent with heavy-tailed noise in continuous and discrete time
[2402.15155] Algorithmically Fair Maximization of Multiple Submodular Objective Functions and Implications to Constrained Fair Division
Abstract page for arXiv paper 2402.15155: Algorithmically Fair Maximization of Multiple Submodular Objective Functions and Implications to Constrained Fair Divi...
[2606.03953] Introduction to stochastic gradient methods
Abstract page for arXiv paper 2606.03953: Introduction to stochastic gradient methods
[2405.13447] Relaxations for binary polynomial optimization via signed certificates
Abstract page for arXiv paper 2405.13447: Relaxations for binary polynomial optimization via signed certificates
[2606.02787] Adaptive Accelerated Mirror Descent in Primal and Dual Spaces
Abstract page for arXiv paper 2606.02787: Adaptive Accelerated Mirror Descent in Primal and Dual Spaces
[2606.03088] A viscosity-Halpern hybrid scheme for countable families of equilibrium and variational inequality problems
Abstract page for arXiv paper 2606.03088: A viscosity-Halpern hybrid scheme for countable families of equilibrium and variational inequality problems
[2406.10407] Suboptimality bounds for trace-bounded SDPs enable a faster and scalable low-rank SDP solver SDPLR+
Abstract page for arXiv paper 2406.10407: Suboptimality bounds for trace-bounded SDPs enable a faster and scalable low-rank SDP solver SDPLR+
[2509.08726] Decentralized Stochastic Nonconvex Optimization under the $(L_0,L_1)$-Smoothness
Abstract page for arXiv paper 2509.08726: Decentralized Stochastic Nonconvex Optimization under the $(L_0,L_1)$-Smoothness
[2510.01377] DeMuon: A Decentralized Muon for Matrix Optimization over Graphs
Abstract page for arXiv paper 2510.01377: DeMuon: A Decentralized Muon for Matrix Optimization over Graphs
[2606.02869] ZOAF: Towards Efficient Zeroth-Order Optimization for Analog/RF Circuit Design
Abstract page for arXiv paper 2606.02869: ZOAF: Towards Efficient Zeroth-Order Optimization for Analog/RF Circuit Design
[2606.02872] Terminal Time and Angle-Constrained Nonlinear Intercept Guidance
Abstract page for arXiv paper 2606.02872: Terminal Time and Angle-Constrained Nonlinear Intercept Guidance
[2606.02879] Direct Informed Sampling on Riemannian Manifolds via Loewner Order Lower Bounds
Abstract page for arXiv paper 2606.02879: Direct Informed Sampling on Riemannian Manifolds via Loewner Order Lower Bounds
[2606.03021] Hint-Guided Diversified Policy Optimization for LLM Reasoning
Abstract page for arXiv paper 2606.03021: Hint-Guided Diversified Policy Optimization for LLM Reasoning
[2606.03287] BA-T: An Iterative Transformer for Two-View Bundle Adjustment
Abstract page for arXiv paper 2606.03287: BA-T: An Iterative Transformer for Two-View Bundle Adjustment
[2606.00542] Rethinking Bregman Divergences in Kronecker-Factored Optimizers
Abstract page for arXiv paper 2606.00542: Rethinking Bregman Divergences in Kronecker-Factored Optimizers
Tracing rays with jank
Pew! Pew! jank is getting faster and faster. Check out the new ray tracing optimization adventure!
[2606.01799] Tree-Guided Identify-Then-Exploit: A Unified Framework of Best Arm Identification and Regret Minimization for Dueling Bandits
Abstract page for arXiv paper 2606.01799: Tree-Guided Identify-Then-Exploit: A Unified Framework of Best Arm Identification and Regret Minimization for Dueling ...
[2606.01857] From Global Policies to Local Strategies: Multi-Objective Optimization of Resource-Specific Handover Policies
Abstract page for arXiv paper 2606.01857: From Global Policies to Local Strategies: Multi-Objective Optimization of Resource-Specific Handover Policies
[2606.01910] Single-Line Drawing Generation via Semantics-Driven Optimization
Abstract page for arXiv paper 2606.01910: Single-Line Drawing Generation via Semantics-Driven Optimization
[2606.01923] Resonant Context Anchoring: Decoupling Attention Routing and Signal Gain at Inference Time
Abstract page for arXiv paper 2606.01923: Resonant Context Anchoring: Decoupling Attention Routing and Signal Gain at Inference Time
[2606.01934] HMPO: Hybrid Median-length Policy Optimization for Chain-of-Thought Compression
Abstract page for arXiv paper 2606.01934: HMPO: Hybrid Median-length Policy Optimization for Chain-of-Thought Compression
![[2307.03391] On Unified Adaptive Black-Litterman Mean-Variance Portfolio Management](/static/img/curated/desks/afbytes-economy.png)
[2307.03391] On Unified Adaptive Black-Litterman Mean-Variance Portfolio Management
Abstract page for arXiv paper 2307.03391: On Unified Adaptive Black-Litterman Mean-Variance Portfolio Management
[2606.01987] Graph Edit Distance Formulation for the Vehicle Routing Problem: Theory and Analysis
Abstract page for arXiv paper 2606.01987: Graph Edit Distance Formulation for the Vehicle Routing Problem: Theory and Analysis