[PDF] Top 20 Learning Translations via Matrix Completion
Has 10000 "Learning Translations via Matrix Completion" found on our website. Below are the top 20 most common "Learning Translations via Matrix Completion".
Learning Translations via Matrix Completion
... seed translations which can be from existing dictionaries or be reliably cho- sen from pseudo-bilingual corpora of compara- ble texts ...by learning a linear function with a reliably chosen seed lexicon, ... See full document
12
Matrix Completion for Graph-Based Deep Semi-Supervised Learning
... trained jointly as in typical GAN framework. The first net- work is a generative model that generates new samples while the other network is the discriminative network. The main problem of this method is training ... See full document
8
A Simpler Approach to Matrix Completion
... low-rank matrix from a partial sampling of its entries is a recurring problem in collab- orative filtering (Rennie and Srebro, 2005; Koren et ...multi-class learning (Argyriou et ...rank matrix ... See full document
18
Collective Matrix Completion
... low-rank matrix completion to a collection of multiple and heterogeneous ...general matrix completion setting where we assume that for each matrix its entries are sampled from natural ... See full document
43
Non-Convex Matrix Completion and Related Problems via Strong Duality
... dictionary learning, we aim to recover a dictionary matrix A from a given signal X in the form of X = AB, provided that the representation coefficient B is sufficiently ...non-convex matrix ... See full document
56
Unsupervised Spectral Learning of WCFG as Low rank Matrix Completion
... unsupervised learning of Weighted Context Free ...kel matrix that has low rank and is linearly constrained to represent a function computed by inside-outside ... See full document
12
Distant Supervision for Relation Extraction with Matrix Completion
... We apply a new technique in the field of ap- plied mathematics, i.e., low-rank matrix comple- tion with convex optimization. The breakthrough work on this topic was made by Cand`es and Recht (2009) who proved that ... See full document
11
Nonconvex matrix completion with Nesterov’s acceleration
... Previous work [16] used the alternating least squares (ALS) procedure to optimize the nonconvex matrix completion. However, this method has high time complexities and requires more iterations to reach ... See full document
12
Matrix Completion and Low-Rank SVD via Fast Alternating Least Squares
... Block coordinate descent (for example, Bertsekas, 1999) is a classical method in optimization that is widely used in the statistical and machine learning communities (Hastie et al., 2009). This is useful ... See full document
36
Distributed Matrix Completion and Robust Factorization
... machine learning algorithms—the matrix factorization algorithms underlying a wide variety of prac- tical applications, including collaborative filtering for recommender systems , ...general matrix ... See full document
48
Heterogeneous Transfer Learning via Deep Matrix Completion with Adversarial Kernel Embedding
... transfer learning methods focus on learning problems where the source domain and target domain are represented by the same type of features (Pan et ...transfer learning ap- proach for cross-domain ... See full document
8
Matrix Completion with the Trace Norm: Learning, Bounding, and Transducing
... the learning al- gorithm the prior knowledge we have on the range of ...directly learning a model φ ◦ W , where φ is usually a sig- moid function (Salakhutdinov and Mnih, 2007; Ma et ...learned ... See full document
23
The non-negative $Q_1$-matrix completion problem
... partial matrix is a rectan- gular array of numbers in which some entries are specified while others are free to be ...partial matrix M is fully specified if all entries of M are specified, ...a ... See full document
8
Learning to Find Translations and Transliterations on the Web
... Chinese counterpart using the language links). We use the English terms (e.g., Emmy Awards) to query a search engine with the target webpage language set to the target language (e.g., Chinese), biasing the search engine ... See full document
5
wEBMT: Developing and Validating an Example Based Machine Translation System using the World Wide Web
... original translations obtained via Web-based MT systems, the translations obtained in our EBMT process are largely of high quality, are ranked highly in the set of output translation candidates, and ... See full document
37
Matrix Completion with Noisy Entries and Outliers
... the matrix com- pletion problem. The result is a new matrix completion method that can handle noisy and outlying ...(non-robust) matrix completion methods to make such methods robust ... See full document
25
Clipped Matrix Completion: A Remedy for Ceiling Effects
... low-rank matrix from its clipped ...hand, matrix completion (MC) methods can recover a low-rank matrix from various information deficits by us- ing the principle of low-rank ...clipped ... See full document
8
Learning to Differentiate Better from Worse Translations
... kernel learning (SKL) framework we propose consists in: (i) designing a struc- tural representation, ...of learning the importance of a predetermined set of ...similar learning framework has been ... See full document
7
The Algebraic Combinatorial Approach for Low-Rank Matrix Completion
... Low-rank matrix completion has received a great deal of attention from the community. Broadly speaking, two main approaches have been developed: convex relaxations of the rank constraints (e.g., Cand` es ... See full document
46
BLC: Private Matrix Factorization Recommenders via Automatic Group Learning
... At the cost of introducing a more complex factorisation task, we find that prediction performance competitive with the state of the art can be obtained using this approach, especially when the user rating matrix R ... See full document
26
Related subjects