Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Claudia Calabrese
Mark W. Moyle
Gou-feng Zhao
Hao Mao
Peter Malec
Marco Cavallaro
Giovanni Venturelli
Chen Ma
Radu Timofte
Kuanrui Yin
Home
/
Author
/
GRZEGORZ SWIRSZCZ
Author Info
Open Visualization
Name
Affiliation
Papers
GRZEGORZ SWIRSZCZ
IBM T.J. Watson Research Center, Yorktown Heights, NY
19
Collaborators
Citations
PageRank
51
61
8.62
Referers
Referees
References
159
380
142
Search Limit
100
380
Publications (19 rows)
Collaborators (51 rows)
Referers (100 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
Gradient Forward-Propagation for Large-Scale Temporal Video Modelling
0
0.34
2021
Sideways: Depth-Parallel Training of Video Models
0
0.34
2020
Verification of Non-Linear Specifications for Neural Networks.
2
0.36
2019
Strength in Numbers: Trading-off Robustness and Computation via Adversarially-Trained Ensembles.
0
0.34
2018
Understanding Synthetic Gradients and Decoupled Neural Interfaces.
9
0.48
2017
Sobolev Training for Neural Networks.
8
0.49
2017
Local minima in training of deep networks.
0
0.34
2016
Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming
2
0.38
2014
Multi-level Lasso for Sparse Multi-task Regression.
0
0.34
2012
Group Orthogonal Matching Pursuit for Logistic Regression
0
0.34
2011
Group Orthogonal Matching Pursuit for Logistic Regression.
0
0.34
2011
Ensemble-Based Method for Task 2: Predicting Traffic Jam
3
0.48
2010
Traffic Velocity Prediction Using GPS Data: IEEE ICDM Contest Task 3 Report
6
0.66
2010
Winning the KDD Cup Orange Challenge with Ensemble Selection.
0
0.34
2009
Grouped Orthogonal Matching Pursuit for Variable Selection and Prediction.
0
0.34
2009
Winning the KDD Cup Orange Challenge with Ensemble Selection
7
0.51
2009
l1 regularization in infinite dimensional feature spaces
4
0.46
2007
An Algorithm For Finding Invariant Algebraic Curves Of A Given Degree For Polynomial Planar Vector Fields
0
0.34
2005
Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method
20
1.41
2004
1