Technology
Freya PAGE: First Optimal Time Complexity for Large-Scale Nonconvex Finite-Sum Optimization with Heterogeneous Asynchronous Computations
(Theorem 4). We also consider Assumption 3. Note that this assumption does not restrict the class of considered Iterative algorithms are traditionally evaluated based on their gradient complexity .
CapProNet: Deep Feature Learning via Orthogonal Projections onto Capsule Subspaces
Liheng Zhang, Marzieh Edraki, Guo-Jun Qi
Then, one can adopt theprinciple of separatingthe presence of an entity and its instantiation parameters into capsule length and orientation, respectively. In particular, we use the lengths of capsules to score the presence of entity classes corresponding to different subspaces, while their orientations are used to instantiate the parameters of entity properties such as poses, scales, deformations and textures.
Primal-DualBlockGeneralized Frank-Wolfe
We propose a generalized variant of Frank-Wolfe algorithm for solving a class ofsparse/low-rank optimization problems.
On the Downstream Performance of Compressed Word Embeddings
Avner May, Jian Zhang, Tri Dao, Christopher Rรฉ
Neural Information Processing Systems http://nips.cc/
Why so gloomy? A Bayesian explanation of human pessimism bias in the multi-armed bandit task
Neural Information Processing Systems http://nips.cc/
LF-Net: Learning Local Features from Images
Yuki Ono, Eduard Trulls, Pascal Fua, Kwang Moo Yi
Neural Information Processing Systems http://nips.cc/