Randomized Online PCA Algorithms with Regret Bounds that are Logarithmic in the Dimension

No abstract is available for this paper.

• Publication year

  2008

• Venue

  Journal of Machine Learning Research

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• The Blessing and the Curse of the Multiplicative Updates

  2010cited by this paper
• Online kernel PCA with entropic matrix updates

  2007cited by this paper
• IEEE TRANSACTIONS ON INFORMATION THEORY , VOL . ? , NO . ? , ? 200 ? 1 Improved Risk Tail Bounds for On-Line Algorithms

  2007cited by this paper
• When Is There a Free Matrix Lunch?

  2007cited by this paper
• Learning Permutations with Exponential Weights

  2007cited by this paper
• Totally corrective boosting algorithms that maximize the margin

  2006cited by this paper
• Online Tracking of Linear Subspaces

  2006cited by this paper
• Prediction, learning, and games

  2006cited by this paper
• Randomized PCA Algorithms with Regret Bounds that are Logarithmic in the Dimension

  2006cited by this paper
• On the eigenspectrum of the gram matrix and the generalization error of kernel-PCA

  2005cited by this paper
• Optimum Follow the Leader Algorithm

  2005cited by this paper
• Efficient algorithms for online decision problems

  2005cited by this paper
• Matrix Exponentiated Gradient Updates for On-line Learning and Bregman Projection

  2005cited by this paper
• Tracking a Small Set of Experts by Mixing Past Posteriors

  2003cited by this paper
• Economic inequality and burden-sharing in the provision of local environmental quality

  2002influential reference
• Path Kernels and Multiplicative Updates

  2002cited by this paper
• Tracking the Best Linear Predictor

  2001influential reference
• Averaging Expert Predictions

  1999cited by this paper
• Relative Loss Bounds for On-Line Density Estimation with the Exponential Family of Distributions

  1999influential reference
• Relative loss bounds for single neurons

  1999cited by this paper
• Relative Loss Bounds for Multidimensional Regression Problems

  1997cited by this paper
• A decision-theoretic generalization of on-line learning and an application to boosting

  1997influential reference
• Tracking the Best Expert

  1995cited by this paper
• Additive versus exponentiated gradient updates for linear prediction

  1995cited by this paper
• A Stable and Efficient Algorithm for the Rank-One Modification of the Symmetric Eigenproblem

  1994cited by this paper
• How to use expert advice

  1993cited by this paper
• The weighted majority algorithm

  1989cited by this paper
• Optimal unsupervised learning in a single-layer linear feedforward neural network

  1989cited by this paper
• An iterative row-action method for interval convex programming

  1981cited by this paper
• Inequalities: Theory of Majorization and Its Applications

  1980cited by this paper
• The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming

  1967cited by this paper
• The{dollar}p{dollar}-Norm Generalization of the LMS Algorithm for Adaptive Filtering

  year unknowncited by this paper

• From Average Sensitivity to Small-Loss Regret Bounds under Random-Order Model

  2026cites this paper
• Adaptive Matrix Online Learning through Smoothing with Guarantees for Nonsmooth Nonconvex Optimization

  2026cites this paper
• Concatenated Matrix SVD: Compression Bounds, Incremental Approximation, and Error-Constrained Clustering

  2026cites this paper
• Multi-Stage Methods for Cost Controlled Data Compression Using Principal Component Analysis

  2025cites this paper
• Instance-Optimal Matrix Multiplicative Weight Update and Its Quantum Applications

  2025influential citation
• Accelerating Multi-Task Temporal Difference Learning under Low-Rank Representation

  2025cites this paper
• WARP: Weight Teleportation for Attack-Resilient Unlearning Protocols

  2025cites this paper
• Inspection Game with Location-Specific Detection Capabilities

  2024cites this paper
• No regret sample selection with noisy labels

  2024influential citation
• Computing Optimal Regularizers for Online Linear Optimization

  2024cites this paper
• Streaming First‐Order Optimization Methods With Momentum for Dominant Eigenspace Estimation

  2024cites this paper
• A Batch-to-Online Transformation under Random-Order Model

  2023cites this paper
• Online Combinatorial Linear Optimization via a Frank-Wolfe-Based Metarounding Algorithm

  2023cites this paper
• Context-Aware Meta-Learning

  2023cites this paper
• Adversarial Sleeping Bandit Problems with Multiple Plays: Algorithm and Ranking Application

  2023cites this paper
• Nonstochastic Contextual Combinatorial Bandits

  2023cites this paper
• No-Regret Online Prediction with Strategic Experts

  2023cites this paper
• Efficient Methods for Non-stationary Online Learning

  2023cites this paper
• Stochastic Scale Invariant Power Iteration for KL-divergence Nonnegative Matrix Factorization

  2023cites this paper
• Fast, Differentiable and Sparse Top-k: a Convex Analysis Perspective

  2023cites this paper
• Adaptive Noisy Matrix Completion

  2022cites this paper
• Lifelong Matrix Completion with Sparsity-Number

  2022cites this paper
• Minimum cost‐compression risk in principal component analysis

  2022cites this paper
• Kernelized Multiplicative Weights for 0/1-Polyhedral Games: Bridging the Gap Between Learning in Extensive-Form and Normal-Form Games

  2022cites this paper
• Context binning, model clustering and adaptivity for data compression of genetic data

  2022cites this paper
• Expected Regret and Pseudo-Regret are Equivalent When the Optimal Arm is Unique

  2022cites this paper
• Step-size Adaptation Using Exponentiated Gradient Updates

  2022cites this paper
• Safe Operation of Connected Vehicles in Complex and Unforeseen Environments

  2022cites this paper
• Rank-Based Decomposable Losses in Machine Learning: A Survey

  2022cites this paper
• Path Integral Methods with Stochastic Control Barrier Functions

  2022cites this paper
• On the equivalence of Oja's algorithm and GROUSE

  2022cites this paper
• Efficient Online-Bandit Strategies for Minimax Learning Problems

  2021cites this paper
• Fault Prediction and Classification for a Doubly-Fed Induction Generator based Wind Turbine by using Random Forest Classifier

  2021cites this paper
• Control Barrier Function Augmentation in Sampling-based Control Algorithm for Sample Efficiency

  2021cites this paper
• k-experts - Online Policies and Fundamental Limits

  2021cites this paper
• Multiplicative Reweighting for Robust Neural Network Optimization

  2021influential citation
• Exponentiated Gradient Reweighting for Robust Training Under Label Noise and Beyond

  2021cites this paper
• Hybrid Regret Bounds for Combinatorial Semi-Bandits and Adversarial Linear Bandits

  2021cites this paper
• Robust Wireless Scheduling under Arbitrary Channel Dynamics and Feedback Delay (Invited Paper)

  2021cites this paper
• Low-Regret Active learning

  2021cites this paper
• Multiplicative Weights Algorithms for Parallel Automated Software Repair

  2021cites this paper
• Models and Solutions of Strategic Resource Allocation Problems: Approximate Equilibrium and Online Learning in Blotto Games. (Modèles et Solutions de Problèmes d'Allocation de Ressources Stratégiques : Équilibre Approximatif et Apprentissage en Ligne dans les Jeux de Blotto)

  2020cites this paper
• Lazy Online Gradient Descent is Universal on Polytopes

  2020cites this paper
• Optimal Exact Matrix Completion Under new Parametrization

  2020cites this paper
• Feature Clustering for Support Identification in Extreme Regions

  2020cites this paper
• Online sparse sliced inverse regression for high-dimensional streaming data

  2020cites this paper
• Rankmax: An Adaptive Projection Alternative to the Softmax Function

  2020influential citation
• A Simple Approach to Online Sparse Sliced Inverse Regression

  2020cites this paper
• Refined approachability algorithms and application to regret minimization with global costs

  2020cites this paper
• Robust and Heavy-Tailed Mean Estimation Made Simple, via Regret Minimization

  2020cites this paper
• Universal Algorithms: Beyond the Simplex

  2020cites this paper
• No Regret Sample Selection with Noisy Labels

  2020influential citation
• Online Sufficient Dimension Reduction Through Sliced Inverse Regression

  2020cites this paper
• Ankou: Guiding Grey-box Fuzzing towards Combinatorial Difference

  2020cites this paper
• Optimal Adaptive Matrix Completion

  2020cites this paper
• Stochastic Approximation Algorithms for Principal Component Analysis

  2019cites this paper
• The random component-wise power method

  2019cites this paper
• Efficient Convex Relaxations for Streaming PCA

  2019cites this paper
• An Implicit Form of Krasulina's k-PCA Update without the Orthonormality Constraint

  2019cites this paper
• Performance Evaluation of Universities and Colleges based on Method of Principal Component Analysis and Data Envelopment Analysis

  2019cites this paper
• Learning with Fenchel-Young Losses

  2019cites this paper
• Online Adaptive Principal Component Analysis and Its extensions

  2019influential citation
• A Rank-1 Sketch for Matrix Multiplicative Weights

  2019cites this paper
• Loss Landscapes of Regularized Linear Autoencoders

  2019cites this paper
• Online eigenvector transformation reflecting concept drift for improving network intrusion detection

  2019cites this paper
• Online Convex Optimization in Changing Environments and its Application to Resource Allocation

  2019influential citation
• Bandit Principal Component Analysis

  2019influential citation
• Beating Stochastic and Adversarial Semi-bandits Optimally and Simultaneously

  2019cites this paper
• Gradient-based Sparse Principal Component Analysis with Extensions to Online Learning

  2019cites this paper
• Automatic Performance Optimization on Heterogeneous Computer Systems using Manycore Coprocessors

  2018cites this paper
• Online learning with kernel losses

  2018influential citation
• Online Learning: A Comprehensive Survey

  2018cites this paper
• Learning of Combinatorial Objects via Extended Formulation

  2018influential citation
• From Principal Subspaces to Principal Components with Linear Autoencoders

  2018cites this paper
• MOSES: A Streaming Algorithm for Linear Dimensionality Reduction

  2018cites this paper
• Stochastic PCA with (cid:96) 2 and (cid:96) 1 Regularization

  2018cites this paper
• Streaming Principal Component Analysis in Noisy Settings

  2018cites this paper
• Efficient Principal Subspace Projection of Streaming Data Through Fast Similarity Matching

  2018cites this paper
• Online Principal Component Analysis for Evolving Data Streams

  2018cites this paper
• A Novel Incremental Dictionary Learning Method for Low Bit Rate Speech Streaming

  2018cites this paper
• Design of an End-to-End Consumer Imaging System Simulator With an Emphasis on Efficient Application of Spatially-Varying Optical Kernels

  2018cites this paper
• Combinatorial Online Prediction

  2018cites this paper
• OAP: An efficient online principal component analysis algorithm for streaming EEG data

  2018cites this paper
• IMAGE COMPRESSION AND ANAYLIS IN WIRELESS ADHOC NETWORKS

  2017cites this paper
• Regret bounds for Non Convex Quadratic Losses Online Learning over Reproducing Kernel Hilbert Spaces

  2017cites this paper
• 2L-PCA: a two-level principal component analyzer for quantitative drug design and its applications

  2017cites this paper
• One-pass Person Re-identification by Sketch Online Discriminant Analysis

  2017cites this paper
• Online Learning of Permutations Using Extended Formulation

  2017cites this paper
• Stochastic Approximation for Canonical Correlation Analysis

  2017influential citation
• Online Dynamic Programming

  2017cites this paper
• A Note on the Unification of Adaptive Online Learning

  2017cites this paper
• Image Compression Using DFT, PCA, DWT AND CT Techniques

  2017cites this paper
• Online Learning of Combinatorial Objects via Extended Formulation

  2016influential citation
• Globally Convergent Stochastic Optimization for Canonical Correlation Analysis

  2016cites this paper
• Global optimization of factor models using alternating minimization

  2016cites this paper
• Stochastic Optimization for Multiview Representation Learning using Partial Least Squares

  2016cites this paper
• Global optimization of factor models and dictionary learning using alternating minimization

  2016cites this paper
• Noise-Tolerant Life-Long Matrix Completion via Adaptive Sampling

  2016cites this paper
• Online PCA with Optimal Regret

  2016influential citation
• Stochastic Optimization for Kernel PCA

  2016cites this paper