Search Results for author:
Found 4 papers, 0 papers with code
Exact Recovery for System Identification with More Corrupt Data than Clean Data
We highlight that the attack vectors are allowed to be correlated with each other in this work, whereas we make some assumptions about the times at which the attacks happen.
Stochastic $L^\natural$-convex Function Minimization
When applied to a stochastic submodular function, the computational complexity of the proposed algorithms is lower than that of the existing stochastic submodular minimization algorithms.
Factorization Approach for Low-complexity Matrix Completion Problems: Exponential Number of Spurious Solutions and Failure of Gradient Methods
It is well-known that the Burer-Monteiro (B-M) factorization approach can efficiently solve low-rank matrix optimization problems under the RIP condition.
A Mathematical Foundation for Robust Machine Learning based on Bias-Variance Trade-off
Conducting a clear comparison for existing RML algorithms in dealing with different samples is difficult due to lack of a unified theoretical framework for RML.
