paper-with-me

Papers

Orthogonalizing Convolutional Layers with the Cayley Transform

2021-04-14 · ICLR 2021 1 · Asher Trockman, J. Zico Kolter

Recent work has highlighted several advantages of enforcing orthogonality in the weight layers of deep networks, such as maintaining the stability of activations, preserving gradient norms, and enhancing adversarial robustness by enforcing low Lipschitz constants. Although numerous methods exist for enforcing the orthogonality of fully-connected layers, those for convolutional layers are more heuristic in nature, often focusing on penalty methods or limited classes of convolutions. In this work, we propose and evaluate an alternative approach to directly parameterize convolutional layers that are constrained to be orthogonal. Specifically, we propose to apply the Cayley transform to a skew-symmetric convolution in the Fourier domain, so that the inverse convolution needed by the Cayley transform can be computed efficiently. We compare our method to previous Lipschitz-constrained and orthogonal convolutional layers and show that it indeed preserves orthogonality to a high degree even for large convolutions. Applied to the problem of certified adversarial robustness, we show that networks incorporating the layer outperform existing deterministic methods for certified defense against $\ell_2$-norm-bounded adversaries, while scaling to larger architectures than previously investigated. Code is available at https://github.com/locuslab/orthogonal-convolutions.

📄 PDF Abstract BibTeX arXiv:2104.07167

Code (1)

locuslab/orthogonal-convolutions 공식 구현 pytorch

Tasks

Adversarial Robustness

Methods 이 논문이 사용한 방법론

Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…

Similar Papers 제목 키워드 기반

Lipschitz-bounded 1D convolutional neural networks using the Cayley transform and the controllability Gramian

2023-03-20 · Patricia Pauli, Ruigang Wang, Ian R. Manchester, Frank Allgöwer

We establish a layer-wise parameterization for 1D convolutional neural networks (CNNs) with built-in end-to-end robustness guarantees. In doing so, we use the Lipschitz constant of the input-output mapping characterized …

Improving LLM Final Representations with Inter-Layer Geometry

2026-03-24 · Tom Ulanovski, Eyal Blyachman, Maya Bechler-Speicher arxiv

The standard in LLM-based prediction is to use the final-layer representation as the input to a downstream predictor. However, intermediate layers may encode complementary task-relevant signals. Existing approaches there…

Graph Neural Network

The E$Δ$-MHC-Geo Transformer: Adaptive Geodesic Operations with Guaranteed Orthogonality

2026-05-07 · Arash Shahmansoori arxiv

We present the E$Δ$-MHC-Geo Transformer, a novel architecture that unifies Manifold-Constrained Hyper-Connections (mHC), Deep Delta Learning (DDL), and the Cayley transform to obtain input-adaptive, unconditionally ortho…

Efficient Riemannian Optimization on the Stiefel Manifold via the Cayley Transform

2020-02-04 · ICLR 2020 1 · Jun Li, Li Fuxin, Sinisa Todorovic

Strictly enforcing orthonormality constraints on parameter matrices has been shown advantageous in deep learning. This amounts to Riemannian optimization on the Stiefel manifold, which, however, is computationally expens…

Riemannian optimization

Ising Models with Hidden Markov Structure: Applications to Probabilistic Inference in Machine Learning

2025-04-14 · F. Herrera, U. A. Rozikov, M. V. Velasco

In this paper, we investigate tree-indexed Markov chains (Gibbs measures) defined by a Hamiltonian that couples two Ising layers: hidden spins \(s(x) \in \{\pm 1\}\) and observed spins \(\sigma(x) \in \{\pm 1\}\) on a Ca…

Anomaly DetectionDenoisingWeakly-supervised Learning