Alina Ene

Orcid: 0000-0002-5818-1807

According to our database1, Alina Ene authored at least 69 papers between 2008 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Online and Streaming Algorithms for Constrained k-Submodular Maximization.
CoRR, 2023

High Probability Convergence of Stochastic Gradient Methods.
CoRR, 2023

Online Ad Allocation with Predictions.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Improved Convergence in High Probability of Clipped Gradient Methods with Heavy Tailed Noise.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

On the Generalization Error of Stochastic Mirror Descent for Quadratically-Bounded Losses: an Improved Analysis.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

High Probability Convergence of Stochastic Gradient Methods.
Proceedings of the International Conference on Machine Learning, 2023

On the Convergence of AdaGrad(Norm) on ℝ<sup>d</sup>: Beyond Convexity, Non-Asymptotic Rate and Acceleration.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

2022
An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint.
Math. Oper. Res., November, 2022

High Probability Convergence for Accelerated Stochastic Mirror Descent.
CoRR, 2022

META-STORM: Generalized Fully-Adaptive Variance Reduced SGD for Unbounded Functions.
CoRR, 2022

On the Convergence of AdaGrad on $\R^{d}$: Beyond Convexity, Non-Asymptotic Rate and Acceleration.
CoRR, 2022

Adaptive Accelerated (Extra-)Gradient Methods with Variance Reduction.
Proceedings of the International Conference on Machine Learning, 2022

Streaming Algorithm for Monotone k-Submodular Maximization with Cardinality Constraints.
Proceedings of the International Conference on Machine Learning, 2022

Adaptive and Universal Algorithms for Variational Inequalities with Optimal Convergence.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Node-weighted Network Design in Planar and Minor-closed Families of Graphs.
ACM Trans. Algorithms, 2021

An Efficient Framework for Balancing Submodularity and Cost.
Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

Projection-Free Bandit Optimization with Privacy Guarantees.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Adaptive Gradient Methods for Constrained Convex Optimization and Variational Inequalities.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Adaptive and Universal Single-gradient Algorithms for Variational Inequalities.
CoRR, 2020

Adaptive Gradient Methods for Constrained Convex Optimization.
CoRR, 2020

A note on maximizing the difference between a monotone submodular function and a linear function.
CoRR, 2020

Parallel Algorithm for Non-Monotone DR-Submodular Maximization.
Proceedings of the 37th International Conference on Machine Learning, 2020

Optimal Streaming Algorithms for Submodular Maximization with Cardinality Constraints.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019
An Optimal Streaming Algorithm for Non-monotone Submodular Maximization.
CoRR, 2019

Improved Convergence for $\ell_\infty$ and $\ell_1$ Regression via Iteratively Reweighted Least Squares.
CoRR, 2019

Submodular maximization with matroid and packing constraints in parallel.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Submodular Maximization with Nearly-optimal Approximation and Adaptivity in Nearly-linear Time.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Improved Convergence for $\ell_1$ and $\ell_∞$ Regression via Iteratively Reweighted Least Squares.
Proceedings of the 36th International Conference on Machine Learning, 2019

Towards Nearly-Linear Time Algorithms for Submodular Maximization with a Matroid Constraint.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs.
SIAM J. Discret. Math., 2018

Online Buy-at-Bulk Network Design.
SIAM J. Comput., 2018

Submodular unsplittable flow on trees.
Math. Program., 2018

A Parallel Double Greedy Algorithm for Submodular Maximization.
CoRR, 2018

Submodular Maximization with Packing Constraints in Parallel.
CoRR, 2018

Mining Tours and Paths in Activity Networks.
Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018

2017
Geometric Packing under Nonuniform Constraints.
SIAM J. Comput., 2017

Decomposable Submodular Function Minimization: Discrete and Continuous.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Approximation Algorithms for Stochastic k-TSP.
Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

2016
A Reduction for Optimizing Lattice Submodular Functions with Diminishing Returns.
CoRR, 2016

On Routing Disjoint Paths in Bounded Treewidth Graphs.
Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

Routing under balance.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Constrained Submodular Maximization: Beyond 1/e.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

On Approximating Maximum Independent Set of Rectangles.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

A New Framework for Distributed Submodular Maximization.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015
The all-or-nothing flow problem in directed graphs with symmetric demand pairs.
Math. Program., 2015

Examining User Experiences through a Multimodal BCI Puzzle Game.
Proceedings of the 19th International Conference on Information Visualisation, 2015

Random Coordinate Descent Methods for Minimizing Decomposable Submodular Functions.
Proceedings of the 32nd International Conference on Machine Learning, 2015

The Power of Randomization: Distributed Submodular Maximization on Massive Datasets.
Proceedings of the 32nd International Conference on Machine Learning, 2015

2014
Comparing interaction techniques for serious games through brain-computer interfaces: A user perception evaluation study.
Entertain. Comput., 2014

Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements.
Proceedings of the Symposium on Theory of Computing, 2014

From Graph to Hypergraph Multiway Partition: Is the Single Threshold the Only Route?
Proceedings of the Algorithms - ESA 2014, 2014

Hardness of Submodular Cost Allocation: Lattice Matching and a Simplex Coloring Conjecture.
Proceedings of the Approximation, 2014

2013
Approximation algorithms for submodular optimization and graph problems
PhD thesis, 2013

Improved Approximation Algorithms for Connected Domatic Partitions and Related Problems
CoRR, 2013

Fast Clustering with Lower Bounds: No Customer too Far, No Shop too Small
CoRR, 2013

Assessing Brain-Computer Interfaces for Controlling Serious Games.
Proceedings of the 5th International Conference on Games and Virtual Worlds for Serious Applications, 2013

Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Poly-logarithmic Approximation for Maximum Node Disjoint Paths with Constant Congestion.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012
Approximation algorithms and hardness of integral concurrent flow.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Geometric packing under non-uniform constraints.
Proceedings of the 28th ACM Symposium on Computational Geometry, 2012

Prize-Collecting Survivable Network Design in Node-Weighted Graphs.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

2011
Prize-collecting Steiner Problems on Planar Graphs.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Fast clustering using MapReduce.
Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2011

Submodular Cost Allocation Problem and Applications.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Approximation Algorithms for Submodular Multiway Partition.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010
Prize-Collecting Steiner Tree and Forest in Planar Graphs
CoRR, 2010

2009
Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs.
Proceedings of the Approximation, 2009

2008
Fast exact and heuristic methods for role minimization problems.
Proceedings of the 13th ACM Symposium on Access Control Models and Technologies, 2008


  Loading...