← Search

Anastasios Sidiropoulos

4 accepted papers

2025

Effective Neural Approximations for Geometric Optimization Problems

NeurIPS 2025poster

Neural networks offer a promising data-driven approach to tackle computationally challenging optimization problems. In this work, we introduce neural approximation frameworks for a family of geometric "extent measure" problems, including shape-fitting descriptors (e.g. minimum enclosing ball or ann…

Cited by 0SourceScholar
2021

Grouping Words with Semantic Diversity

NAACL 2021long

Deep Learning-based NLP systems can be sensitive to unseen tokens and hard to learn with high-dimensional inputs, which critically hinder learning generalization. We introduce an approach by grouping input words based on their semantic diversity to simplify input language representation with low amb…

2021

NN-Baker: A Neural-network Infused Algorithmic Framework for Optimization Problems on Geometric Intersection Graphs

NeurIPS 2021poster

Recent years have witnessed a surge of approaches to use neural networks to help tackle combinatorial optimization problems, including graph optimization problems. However, theoretical understanding of such approaches remains limited. In this paper, we consider the geometric setting, where graphs ar…

Cited by 5SourcePDFScholar
2019

A Polynomial Time Algorithm for Log-Concave Maximum Likelihood via Locally Exponential Families

NeurIPS 2019poster

We consider the problem of computing the maximum likelihood multivariate log-concave distribution for a set of points. Specifically, we present an algorithm which, given $n$ points in $\mathbb{R}^d$ and an accuracy parameter $\eps>0$, runs in time $\poly(n,d,1/\eps),$ and returns a log-concave dist…

Cited by 12SourcePDFScholar