We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
各イテレーションで二次計画法QPを解く 各タスクの勾配をすべて使用する
さらに,一般のシングルタスクのみに対する評価とは別に,
https://arxiv.org/abs/1706.08840
David Lopez-Paz and Marc’Aurelio Ranzato Facebook Artificial Intelligence Research {dlp,ranzato}@fb.com
[v1] Mon, 26 Jun 2017 14:53:34 UTC (2,190 KB)
The text was updated successfully, but these errors were encountered:
sarrrrry
No branches or pull requests
一言でいうと
各イテレーションで二次計画法QPを解く
各タスクの勾配をすべて使用する
さらに,一般のシングルタスクのみに対する評価とは別に,
の指標を提案
論文リンク
https://arxiv.org/abs/1706.08840
著者/所属機関
David Lopez-Paz and Marc’Aurelio Ranzato
Facebook Artificial Intelligence Research
{dlp,ranzato}@fb.com
投稿日付(yyyy/MM/dd)
[v1] Mon, 26 Jun 2017 14:53:34 UTC (2,190 KB)
概要
新規性・差分
手法
結果
コメント
The text was updated successfully, but these errors were encountered: