arXiv research

Paper analyzes Hit-and-Run's convergence rates and applies similar methods to randomized Kaczmarz.

Gibbs sampler mixes quickly for certain smooth distributions.

New algorithms for interactive learning match minimax bounds efficiently.

Random feature maps improve forecasting with cheaper computation.

Determinantal point processes (DPPs) are distributions over sets of items that model diversity using kernels. Their applications in machine learning include summary extraction and recommendation systems. Yet, the cost of sampling from a DPP is prohibitive in large-scale applications, which has triggered an effort towar…

Efficiently implements polar slice sampling for high-dimensional distributions.

Improved Thompson Sampling outperforms existing Bayesian optimization methods.

Algorithm samples composite logconcave densities efficiently.

Gibbs sampler contracts entropy under strong log-concavity, improving mixing time.

Faster algorithm for sampling logconcave densities in high dimensions.

We report on results concerning a partially aggregated Stock Flow Consistent (SFC) macroeconomic model in the stationary state where the sectors of banks and firms are aggregated, the sector of households is dis-aggregated, and the probability density function (pdf) of the wealth of households is exogenous, constrained…

TML package uses tropical geometry for machine learning tasks.

Nested Slice Sampling accelerates Nested Sampling for GPU acceleration.

Random feature maps improve forecasting of chaotic dynamical systems.

We examine volume computation of general-dimensional polytopes and more general convex bodies, defined as the intersection of a simplex by a family of parallel hyperplanes, and another family of parallel hyperplanes or a family of concentric ellipsoids. Such convex bodies appear in modeling and predicting financial cri…

We study the problem of "isotropically rounding" a polytope $K\subset\mathbb{R}^n$, that is, computing a linear transformation which makes the uniform distribution on the polytope have roughly identity covariance matrix. We assume $K$ is defined by $m$ linear inequalities, with guarantee that $rB\subset K\subset RB$, w…

RHMC improves sampling polytopes defined by inequalities with barriers.

This paper develops a framework for training and evaluating neural networks for MPC.

Examines algorithmic modeling across three cultures.

Playing repeated matrix games (RMG) while maximizing the cumulative returns is a basic method to evaluate multi-agent learning (MAL) algorithms. Previous work has shown that $UCB$, $M3$, $S$ or $Exp3$ algorithms have good behaviours on average in RMG. Besides, hedging algorithms have been shown to be effective on predi…

Meta-algorithm selection aims to choose the best algorithm selector for a given problem instance.

Proposes CLRS benchmark to evaluate algorithmic reasoning.

Combines multiple bandit algorithms to create a nearly optimal single algorithm.

We propose accelerated randomized coordinate descent algorithms for stochastic optimization and online learning. Our algorithms have significantly less per-iteration complexity than the known accelerated gradient algorithms. The proposed algorithms for online learning have better regret performance than the known rando…

The exchange algorithm is studied for its convergence and asymptotic variance.

Bayesian networks (BN) are used in a big range of applications but they have one issue concerning parameter learning. In real application, training data are always incomplete or some nodes are hidden. To deal with this problem many learning parameter algorithms are suggested foreground EM, Gibbs sampling and RBE algori…

No algorithm outperforms uniform sampling in A/B testing.

Improves algorithm selection for thousands of candidates using dyadic features.

This review article surveys data augmentation MCMC algorithms.

Bayesian learning rule unifies and generalizes various machine learning algorithms.

Algorithm design is a laborious process and often requires many iterations of ideation and validation. In this paper, we explore automating algorithm design and present a method to learn an optimization algorithm, which we believe to be the first method that can automatically discover a better algorithm. We approach th…

This review summarizes five Lasso optimization algorithms.

Neural networks mimic algorithms to solve complex problems.

Paper proposes a reinforcement learning framework for efficient hyper-parameter tuning of stochastic optimization algorithms.

In this paper, we propose a convergent parallel best-response algorithm with the exact line search for the nondifferentiable nonconvex sparsity-regularized rank minimization problem. On the one hand, it exhibits a faster convergence than subgradient algorithms and block coordinate descent algorithms. On the other hand,…

Approximate probabilistic inference algorithms are central to many fields. Examples include sequential Monte Carlo inference in robotics, variational inference in machine learning, and Markov chain Monte Carlo inference in statistics. A key problem faced by practitioners is measuring the accuracy of an approximate infe…

New algorithms reduce bilevel optimization complexity to ε^(-1.5).

The inverse-free extreme learning machine (ELM) algorithm proposed in [4] was based on an inverse-free algorithm to compute the regularized pseudo-inverse, which was deduced from an inverse-free recursive algorithm to update the inverse of a Hermitian matrix. Before that recursive algorithm was applied in [4], its impr…

Researchers analyze how algorithmic and implementation choices affect RL performance.

Study on selecting between base algorithms in stochastic bandit problems.

New bounds derived for KG algorithm's performance in finite time.

Paper proves linear convergence of SCMS algorithm for directional data.

We resolve the fundamental problem of online decoding with general $n^{th}$ order ergodic Markov chain models. Specifically, we provide deterministic and randomized algorithms whose performance is close to that of the optimal offline algorithm even when latency is small. Our algorithms admit efficient implementation vi…

MLE and CVE are equivalent under exponential families, leading to faster and more stable EM algorithms.

New algorithm speeds up learning of graphical models.

The goal of data-driven algorithm design is to obtain high-performing algorithms for specific application domains using machine learning and data. Across many fields in AI, science, and engineering, practitioners will often fix a family of parameterized algorithms and then optimize those parameters to obtain good perfo…

The paper examines how algorithmic classification affects behavior and proposes democratizing stakes to mitigate predatory practices.

Run2Survive uses survival analysis for algorithm selection, outperforming traditional methods.