https://github.com/minehly/awesome-paper-for-graph-learning-theory
Generalization bounds for graph convolutional neural networks via Rademacher complexity
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
관련 논문과 평가 결과에 연결된 구현입니다. 출처에서 확인된 저자 구현에는 공식 코드 표시가 있습니다.
Generalization bounds for graph convolutional neural networks via Rademacher complexity
Learning an Explicit Hyperparameter Prediction Function Conditioned on Tasks
Estimating individual treatment effect: generalization bounds and algorithms
Principles and Algorithms for Forecasting Groups of Time Series: Locality and Globality
Stable Sample Compression Schemes: New Applications and an Optimal SVM Margin Bound
Stable Sample Compression Schemes: New Applications and an Optimal SVM Margin Bound
NICO++: Towards Better Benchmarking for Domain Generalization
Estimating individual treatment effect: generalization bounds and algorithms
Estimating individual treatment effect: generalization bounds and algorithms
Rethinking Breiman's Dilemma in Neural Networks: Phase Transitions of Margin Dynamics
Transformers as Algorithms: Generalization and Stability in In-context Learning
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.