Goto

Collaborating Authors

 Country


d61e9e58ae1058322bc169943b39f1d8-Paper.pdf

Neural Information Processing Systems

Setprediction tasksrequire thematching between predicted setandground truth set in order to propagate the gradient signal. Recent works have performed this matching in the original feature space thus requiring predefined distance functions.



NodeFormer: AScalable Graph Structure Learning Transformerfor Node Classification

Neural Information Processing Systems

Appendix C 4. Ifyouareusingexistingassets (e.g., code, data, models) orcurating/releasingnewassets... (a) Ifyourworkusesexistingassets, didyoucitethecreators?[Yes]See





Firstorderexpansionofconvexregularized estimators

Neural Information Processing Systems

Such first order expansion implies that the risk ofˆβ is asymptotically the same as the risk ofη which leads to a precise characterization of the MSE ofˆβ; this characterization takes aparticularly simple form for isotropic design. Such first order expansion also leads to inference results based onˆβ. We provide sufficient conditions for theexistence ofsuch first order expansion forthree regularizers: theLasso inits constrainedform,thelassoinitspenalizedform,andtheGroup-Lasso.Theresults apply to general loss functions under some conditions and those conditions are satisfied for the squared loss in linear regression and for the logistic loss in the logisticmodel.


Large Graph Property Prediction via Graph Segment Training

Neural Information Processing Systems

Learning to predict properties of a large graph is challenging because each prediction requires the knowledge of an entire graph, while the amount of memory available during training is bounded.