arXiv research

A new restart criterion for k-means++ improves clustering quality and adapts to data difficulty.

Recent studies have shown that proximal gradient (PG) method and accelerated gradient method (APG) with restarting can enjoy a linear convergence under a weaker condition than strong convexity, namely a quadratic growth condition (QGC). However, the faster convergence of restarting APG method relies on the potentially …

We consider the generic approach of using an experience memory to help exploration by adapting a restart distribution. That is, given the capacity to reset the state with those corresponding to the agent's past observations, we help exploration by promoting faster state-space coverage via restarting the agent from a mo…

Study adapts combinatorial semi-bandit for piecewise stationary, causally related rewards.

Paper adds a restart mechanism to a drawdown control policy for better trading performance.

New method tracks significant arm switches to improve bandit algorithms.

Study on improving the linear two-time-scale stochastic approximation method with a restarting scheme.

A new sampling method called Restart improves both speed and quality of generative processes.

BRPC online Bayesian calibration handles gradual and abrupt system changes.

New algorithms boost SAT solver performance by optimizing restart strategies.

Master algorithm fails to detect non-stationarity in practical settings.

Improved SEG method converges to Nash equilibrium in bilinear games.

A new algorithm solves nonnegative least squares faster with nonnegative data.

RePS improves diffusion models for solving inverse problems efficiently.

There is a general trend towards solving problems suited to deep learning with more complex deep learning architectures trained on larger training sets. This requires longer compute times and greater data parallelization or model parallelization. Both data and model parallelism have been historically faster in paramete…

We derive an optimal policy for adaptively restarting a randomized algorithm, based on observed features of the run-so-far, so as to minimize the expected time required for the algorithm to successfully terminate. Given a suitable Bayesian prior, this result can be used to select the optimal black-box optimization algo…

WITCHcraft improves PGD attacks with random step size, enhancing efficiency.

New RL algorithm tackles nonstationary MDPs with linear approximations and varying rewards.

Algorithm adapts to non-stationary rewards without prior knowledge.

WARPd method solves inverse problems with approximate sharpness conditions.

In this paper we develop a Morse theory for the uniform energy. We use the one-sided directional derivative of the distance function to study the minimizing properties of variations through closed geodesics. This derivative is then used to define a one-sided directional derivative for the uniform energy which allows us…

PER-ETD improves ETD by reducing variance to polynomial complexity.

A parameter-free PGD algorithm for convex optimization.

We develop a projected Nesterov's proximal-gradient (PNPG) approach for sparse signal reconstruction that combines adaptive step size with Nesterov's momentum acceleration. The objective function that we wish to minimize is the sum of a convex differentiable data-fidelity (negative log-likelihood (NLL)) term and a conv…

Online distributional prediction with latent cluster geometry

New bandit algorithm detects and adapts to seasonal changes in rewards.

We consider the problem of online forecasting of sequences of length $n$ with total-variation at most $C_n$ using observations contaminated by independent $σ$-subgaussian noise. We design an $O(n\log n)$-time algorithm that achieves a cumulative square error of $\tilde{O}(n^{1/3}C_n^{2/3}σ^{4/3} + C_n^2)$ with high pro…

LLMs optimize quantum circuits by iteratively improving proposals with feedback and memory traces.

Simple adaptive attacks can jailbreak state-of-the-art safety-aligned language models.

Paper tackles non-stationary kernelized bandits with near-optimal algorithm.

Continuous optimization is an important problem in many areas of AI, including vision, robotics, probabilistic inference, and machine learning. Unfortunately, most real-world optimization problems are nonconvex, causing standard convex techniques to find only local optima, even with extensions like random restarts and …

New algorithms improve boosting by optimizing chance-corrected measures.

ParaMonte::Python streamlines Bayesian data analysis with fast Monte Carlo and MCMC routines.

PROPO tackles non-stationary MDPs with efficient policy optimization.

The convergence rate and final performance of common deep learning models have significantly benefited from heuristics such as learning rate schedules, knowledge distillation, skip connections, and normalization layers. In the absence of theoretical underpinnings, controlled experiments aimed at explaining these strate…

One-pass optimisation for high-dimensional hyperparameters.

Model-free deep reinforcement learning (RL) algorithms have been widely used for a range of complex control tasks. However, slow convergence and sample inefficiency remain challenging problems in RL, especially when handling continuous and high-dimensional state spaces. To tackle this problem, we propose a general acce…

New algorithm optimizes beam and rate allocation in mmWave systems for multiple users.

A scalable framework preserves personalized higher-order network proximities.

Dual training method for EBMs with overparametrized neural networks.

Unified approach for non-stationary linear bandits with dynamic regret.

New RL algorithm tackles non-stationary environments with flexible policy updates.

Algorithm minimizes control regret for non-stationary LQR systems.

Determinantal consensus clustering improves clustering robustness.

Algorithm reduces decision-making errors in multi-agent bandit problems.

SRSGD improves DNN training speed and accuracy.

Given a generic Lagrangian system, its Euler-Lagrange operator obeys Noether identities which need not be independent, but satisfy first-stage Noether identities, and so on. This construction is generalized to arbitrary differential operators on a smooth fiber bundle. Namely, if a certain necessary and sufficient condi…

Paper speeds up tensor factorization algorithms.