Trend filtering on graphs

Journal of Machine Learning Research

Volumn 17, Issue , 2016, Pages 1-41

  Wang, Yu Xiang ^a,b   Sharpnack, James ^c   Smola, Alexander J ^a,d   Tibshirani, Ryan J ^a,b  

^a Carnegie Mellon University ^*  (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d Marianas Labs   (United States)

Author keywords

Fused lasso; Graph smoothing; Local adaptivity; Total variation denoising; Trend filtering

Indexed keywords

ARTIFICIAL INTELLIGENCE; SOFTWARE ENGINEERING;

ADAPTIVE ESTIMATORS; ADAPTIVITY; CONVEX MINIMIZATION; DE-NOISING; FUSED LASSOS; GRAPH SMOOTHING; NEWTON ALGORITHM; NON-PARAMETRIC REGRESSION;

IMAGE DENOISING;

EID: 84989187855     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (46)

1. Alvaro Barbero and Suvrit Sra. Fast Newton-type methods for total variation regularization. In International Conference on Machine Learning (ICML-11), volume 28, pages 313-320, 2011.
2. Alvaro Barbero and Suvrit Sra. Modular proximal optimization for multidimensional total-variation regularization. arXiv: 1411.0589, 2014.
3. Dimitri P Bertsekas. Projected Newton methods for optimization problems with simple constraints. SIAM Journal on Control and Optimization, 20(2):221-246, 1982.
4. Yuri Boykov and Vladimir Kolmogorov. An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE Trans. on Pattern Analysis and Machine Intelligence, 26(9):1124-1137, 2004.
5. Kristian Bredies, Karl Kunisch, and Thomas Pock. Total generalized variation. SIAM Journal on Imaging Sciences, 3(3):492-526, 2010.
6. Peter Buhlmann and Sara van de Geer. Statistics for High-Dimensional Data. Springer, Berlin, 2011.
7. Bernd Carl. Metric entropy of convex hulls in Hilbert spaces. Bulletin of the London Mathematical Society, 29(04):452-458, 1997.
8. Antonin Chambolle and Jerome Darbon. On total variation minimization and surface evolution using parametric maximum flows. International Journal of Computer Vision, 84(3):288-307, 2009.
9. Fan Chung and Mary Radcliffe. On the spectra of general random graphs. The Electronic Journal of Combinatorics, 18(1), 2011.
10. Ronald Coiman and Mauro Maggioni. Diffusion wavelets. Applied and Computational Harmonic Analysis, 21(2):53-94, 2006.
11. Samuel Conte and Carl de Boor. Elementary Numerical Analysis: An Algorithmic Approach. McGraw-Hill, New York, 1980. International Series in Pure and Applied Mathematics.
12. David L. Donoho and Iain Johnstone. Adapting to unknown smoothness via wavelet shrinkage. Journal of the American Statistical Association, 90(432):1200-1224, 1995.
13. Harish Doraiswamy, Nivan Ferreira, Theodoros Damoulas, Juliana Freire, and Claudio Silva. Using topological analysis to support event-guided exploration in urban data. Visualization and Computer Graphics, IEEE Transactions on, PP(99), 2014.
14. Uriel Feige and Eran Ofek. Spectral techniques applied to sparse random graphs. Random Structures & Algorithms, 27(2):251-275, 2005.
15. Miroslav Fiedler. Algebraic connectivity of graphs. Czechoslovak Mathematical Journal, 23(98):298-305, 1973.
16. Sergei K. Godunov and Viktor S. Ryabenkii. Difference Schemes: An Introduction to the Underlying Theory. Elsevier, Amsterdam, 1987. Number 19 in Studies in Mathematics and Its Applications.
17. Holger Hoefling. A path algorithm for the fused lasso signal approximator. Journal of Computational and Graphical Statistics, 19(4):984-1006, 2010.
18. Jeff Irion. Multiscale Transformations for Signals on Graphs: Methods and Applications. PhD thesis, Department of Mathematical Sciences, University of California at Davis, 2015.
19. Jonathan Kelner, Lorenzo Orecchia, Aaron Sidford, and Zeyuan Allen Zhu. A simple, combinatorial algorithm for solving SDD systems in nearly-linear time. Proceedings of the ACM Annual Symposium on Theory of Computing (STOC-13), 45:911-920, 2013.
20. 1 trend filtering. SIAM Review, 51(2):339-360, 2009.
21. Risi Kondor and John D. Lafferty. Diffusion kernels on graphs and other discrete structures. In International Conference on Machine Learning (ICML-02), pages 315-322, San Francisco, CA, 2002. Morgan Kaufmann.
22. Ioannis Koutis, Gary Miller, and Richard Peng. A nearly-m log n time solver for SDD linear systems. Proceedings of the IEEE Annual Symposium on Foundations of Computer Science (FOCS-11), 52:590-598, 2011.
23. Alexander Lubotzky, Ralph Phillips, and Peter Sarnak. Ramanujan graphs. Combinatorica, 8(3): 261-277, 1988.
24. Enno Mammen and Sara van de Geer. Locally adaptive regression splines. Annals of Statistics, 25 (1):387-413, 1997.
25. Adam W Marcus, Daniel A Spielman, and Nikhil Srivastava. Ramanujan graphs and the solution of the Kadison-Singer problem. arXiv: 1408.4421, 2014.
26. Julian McAuley and Jure Leskovec. Learning to discover social circles in ego networks. Advances in Neural Information Processing Systems, 25, 2012.
27. Aaditya Ramdas and Ryan J Tibshirani. Fast and flexible admm algorithms for trend filtering. Journal of Computational and Graphical Statistics, 2015.
28. Leonid I. Rudin, Stanley Osher, and Emad Faterni. Nonlinear total variation based noise removal algorithms. Physica D: Nonlinear Phenomena, 60:259-268, 1992.
29. Simon Setzer, Gabriel Steidl, and Tanja Teuber. Infimal convolution regularizations with discrete l1-type functionals. Communications in Mathematical Science, 9(3):797-827, 2011.
30. James Sharpnack, Alessandro Rinaldo, and Aarti Singh. Sparsistency via the edge lasso. International Conference on Artificial Intelligence and Statistics (AISTATS-12), 15:1028-1036, 2012.
31. James Sharpnack, Aarti Singh, and Akshay Krishnamurthy. Detecting activations over graphs using spanning tree wavelet bases. In International Conference on Artificial Intelligence and Statistics (AISTATS-13), volume 16, pages 536-544, 2013a.
32. James Sharpnack, Aarti Singh, and Alessandro Rinaldo. Changepoint detection over graphs with the spectral scan statistic. In International Conference on Artificial Intelligence and Statistics (AISTATS-13), volume 16, pages 545-553, 2013b.
33. David Shuman, Sunil Narang, Pascal Frossard, Antonio Ortega, and Pierre Vandergheynst. The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains. IEEE Signal Processing Magazine, 30(3):83-98, 2013.
34. Alexander Smola and Risi Kondor. Kernels and regularization on graphs. In Bernhard Scholkopf and Manfred Warmuth, editors, Learning Theory and Kernel Machines, volume 2777 of Lecture Notes in Computer Science, pages 144-158. Springer, Berlin, 2003.
35. Daniel Spielman and Shang-Hua Teng. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. Proceedings of the ACM Annual Symposium on Theory of Computing (STOC-04), 36:81-90, 2004.
36. Gabriel Steidl, Stephan Didas, and Julia Neumann. Splines in higher order TV regularization. International Journal of Computer Vision, 70(3):214-255, 2006.
37. Partha Pratim Talukdar and Koby Crammer. New regularized algorithms for transductive learning. In Machine Learning and Knowledge Discovery in Databases, pages 442-457. Springer, 2009.
38. Partha Pratim Talukdar and Fernando Pereira. Experiments in graph-based semi-supervised learning methods for class-instance acquisition. In Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics, pages 1473-1481. Association for Computational Linguistics, 2010.
39. Robert Tibshirani, Michael Saunders, Saharon Rosset, Ji Zhu, and Keith Knight. Sparsity and smoothness via the fused lasso. Journal of the Royal Statistical Society: Series B, 67(1):91-108, 2005.
40. Ryan J. Tibshirani. Adaptive piecewise polynomial estimation via trend filtering. Annals of Statistics, 42(1):285-323, 2014.
41. Ryan J. Tibshirani and Jonathan Taylor. The solution path of the generalized lasso. Annals of Statistics, 39(3):1335-1371, 2011.
42. Ryan J. Tibshirani and Jonathan Taylor. Degrees of freedom in lasso problems. Annals of Statistics, 40(2):1198-1232, 2012.
43. Sara van de Geer. Estimating a regression function. Annals of Statistics, 18(2):907-924, 1990.
44. Sara van de Geer and Johannes Lederer. The lasso, correlated design, and improved oracle inequalities. IMS Collecions, 9:303-316, 2013.
45. Nisheeth Vishnoi. Lx = b: Laplacian solvers and their algorithmic applications. Foundations and Trends in Theoretical Computer Science, 8(1-2):1-141, 2012.
46. Yu-Xiang Wang, Alex Smola, and Ryan J. Tibshirani. The falling factorial basis and its statistical properties. In International Conference on Machine Learning (ICML-14), volume 31, 2014.