Soledad Villar

Orcid: 0000-0003-4968-3829

According to our database1, Soledad Villar authored at least 38 papers between 2015 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Dimensionless machine learning: Imposing exact units equivariance.
J. Mach. Learn. Res., 2023

Structuring Representation Geometry with Rotationally Equivariant Contrastive Learning.
CoRR, 2023

GeometricImageNet: Extending convolutional neural networks to vector and tensor images.
CoRR, 2023

The passive symmetries of machine learning.
CoRR, 2023

Approximately Equivariant Graph Networks.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Fine-grained Expressivity of Graph Neural Networks.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023


2022
Dimensionality Reduction, Regularization, and Generalization in Overparameterized Regressions.
SIAM J. Math. Data Sci., 2022

Sketch-and-solve approaches to k-means clustering by semidefinite programming.
CoRR, 2022

Graph Neural Networks for Community Detection on Sparse Graphs.
CoRR, 2022

Deep Learning is Provably Robust to Symmetric Label Noise.
CoRR, 2022

Shuffled linear regression through graduated convex relaxation.
CoRR, 2022

Equivariant maps from invariant functions.
CoRR, 2022

From Local to Global: Spectral-Inspired Graph Neural Networks.
CoRR, 2022

MarkerMap: nonlinear marker selection for single-cell studies.
CoRR, 2022

2021
A simple equivariant machine learning method for dynamics based on scalars.
CoRR, 2021

Scalars are universal: Gauge-equivariant machine learning, structured like classical physics.
CoRR, 2021

Fitting very flexible models: Linear regression with large numbers of parameters.
CoRR, 2021

Scalars are universal: Equivariant machine learning, structured like classical physics.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

A Short Tutorial on The Weisfeiler-Lehman Test And Its Variants.
Proceedings of the IEEE International Conference on Acoustics, 2021

2020
SqueezeFit: Label-Aware Dimensionality Reduction by Semidefinite Programming.
IEEE Trans. Inf. Theory, 2020

MREC: a fast and versatile framework for aligning and matching point clouds with applications to single cell molecular data.
CoRR, 2020

Can Graph Neural Networks Count Substructures?
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Efficient Belief Propagation for Graph Matching.
Proceedings of the 2020 IEEE International Conference on Acoustics, 2020

2019
Fair redistricting is hard.
Theor. Comput. Sci., 2019

Experimental performance of graph neural networks on random instances of max-cut.
CoRR, 2019

On the equivalence between graph isomorphism testing and function approximation with GNNs.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

2018
Utility Ghost: Gamified redistricting with partisan symmetry.
CoRR, 2018

SUNLayer: Stable denoising with generative networks.
CoRR, 2018

Revised Note on Learning Quadratic Assignment with Graph Neural Networks.
Proceedings of the 2018 IEEE Data Science Workshop, 2018

2017
Probably certifiably correct k-means clustering.
Math. Program., 2017

Projected Power Iteration for Network Alignment.
CoRR, 2017

A Note on Learning Algorithms for Quadratic Assignment with Graph Neural Networks.
CoRR, 2017

2016
A polynomial-time relaxation of the Gromov-Hausdorff distance.
CoRR, 2016

Clustering subgaussian mixtures by semidefinite programming.
CoRR, 2016

Clustering subgaussian mixtures with k-means.
Proceedings of the 2016 IEEE Information Theory Workshop, 2016

2015
On the tightness of an SDP relaxation of k-means.
CoRR, 2015

Relax, No Need to Round: Integrality of Clustering Formulations.
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015


  Loading...