Search Results for author:
Found 3 papers, 0 papers with code
On the Complexity of the Weighted Fused Lasso
The solution path of the 1D fused lasso for an $n$-dimensional input is piecewise linear with $\mathcal{O}(n)$ segments (Hoefling et al. 2010 and Tibshirani et al 2011).
A message-passing algorithm for multi-agent trajectory planning
We describe a novel approach for computing collision-free \emph{global} trajectories for $p$ agents with specified initial and final configurations, based on an improved version of the alternating direction method of multipliers (ADMM).
Support Recovery for the Drift Coefficient of High-Dimensional Diffusions
Consider the problem of learning the drift coefficient of a $p$-dimensional stochastic differential equation from a sample path of length $T$.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
