From post

Quilting Stochastic Kronecker Product Graphs to Generate Multiplicative Attribute Graphs.

, и . AISTATS, том 22 из JMLR Proceedings, стр. 1389-1397. JMLR.org, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Efficiently Sampling Multiplicative Attribute Graphs Using a Ball-Dropping Process, и . CoRR, (2012)Robustness to Capitalization Errors in Named Entity Recognition., , и . W-NUT@EMNLP, стр. 237-242. Association for Computational Linguistics, (2019)A Scalable Asynchronous Distributed Algorithm for Topic Modeling., , , , и . WWW, стр. 1340-1350. ACM, (2015)Robust Multi-Task Learning with Excess Risks., , , , , , , и . ICML, OpenReview.net, (2024)Deep Active Learning for Named Entity Recognition., , , , и . Rep4NLP@ACL, стр. 252-256. Association for Computational Linguistics, (2017)MICO: Selective Search with Mutual Information Co-training., , , , и . COLING, стр. 1179-1192. International Committee on Computational Linguistics, (2022)Exposing Privacy Gaps: Membership Inference Attack on Preference Data for LLM Alignment., , , , и . CoRR, (2024)Distributed Stochastic Optimization of Regularized Risk via Saddle-Point Problem., , , и . ECML/PKDD (1), том 10534 из Lecture Notes in Computer Science, стр. 460-476. Springer, (2017)Quilting Stochastic Kronecker Product Graphs to Generate Multiplicative Attribute Graphs., и . AISTATS, том 22 из JMLR Proceedings, стр. 1389-1397. JMLR.org, (2012)How to filter out random clickers in a crowdsourcing-based study?, , и . BELIV, стр. 15. ACM, (2012)