3 papers
math.OC2026
Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming
Valentine Olanubi, Phineas Agar, Brendan Ames
We consider the densest submatrix problem, which seeks the submatrix of fixed size of a given binary matrix that contains the most nonzero entries. This problem is a natural genera…
stat.ML2026
Deflation-Free Optimal Scoring
Sharmin Afroz, Brendan Ames
Sparse Optimal Scoring (SOS) reformulates linear discriminant analysis to enable feature selection through elastic net regularization, making it well-suited for high-dimensional se…
q-bio.NC2025
Dyadic Neural Dynamics: Extending Representation Learning to Social Neuroscience
Maria Glushanina, Jeffrey Huang, Michelle McCleod +2
Social communication fundamentally involves at least two interacting brains, creating a unique modeling problem. We present the first application of Contrastive Embedding for Behav…