Liudmila Ostroumova

Orcid: 0000-0002-1520-4167

Affiliations:
  • Moscow Institute of Physics and Technology, Russia


According to our database1, Liudmila Ostroumova authored at least 60 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Measuring Diversity: Axioms and Challenges.
CoRR, 2024

Challenges of Generating Structurally Diverse Graphs.
CoRR, 2024

TabGraphs: A Benchmark and Strong Baselines for Learning on Graphs with Tabular Node Features.
CoRR, 2024

Discrete Neural Algorithmic Reasoning.
CoRR, 2024

2023
Neural Algorithmic Reasoning Without Intermediate Supervision.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Characterizing Graph Datasets for Node Classification: Homophily-Heterophily Dichotomy and Beyond.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Evaluating Robustness and Uncertainty of Graph Models Under Structural Distributional Shifts.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Which Tricks are Important for Learning to Rank?
Proceedings of the International Conference on Machine Learning, 2023

Gradient Boosting Performs Gaussian Process Inference.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

A critical look at the evaluation of GNNs under heterophily: Are we really making progress?
Proceedings of the Eleventh International Conference on Learning Representations, 2023

2022
When Less Is More: Systematic Analysis of Cascade-Based Community Detection.
ACM Trans. Knowl. Discov. Data, 2022

Characterizing Graph Datasets for Node Classification: Beyond Homophily-Heterophily Dichotomy.
CoRR, 2022

Gradient Boosting Performs Low-Rank Gaussian Process Inference.
CoRR, 2022

Good Classification Measures and How to Find Them.
CoRR, 2022

Graph-based Nearest Neighbor Search in Hyperbolic Spaces.
Proceedings of the Tenth International Conference on Learning Representations, 2022

2021
Shifts: A Dataset of Real Distributional Shift Across Multiple Large-Scale Tasks.
CoRR, 2021

Overlapping Spaces for Compact Graph Representations.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Shifts: A Dataset of Real Distributional Shift Across Multiple Large-Scale Tasks.
Proceedings of the Neural Information Processing Systems Track on Datasets and Benchmarks 1, 2021

Good Classification Measures and How to Find Them.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

SGLB: Stochastic Gradient Langevin Boosting.
Proceedings of the 38th International Conference on Machine Learning, 2021

Systematic Analysis of Cluster Similarity Indices: How to Validate Validation Measures.
Proceedings of the 38th International Conference on Machine Learning, 2021

Uncertainty in Gradient Boosting via Ensembles.
Proceedings of the 9th International Conference on Learning Representations, 2021

Boost then Convolve: Gradient Boosting Meets Graph Neural Networks.
Proceedings of the 9th International Conference on Learning Representations, 2021

2020
Overlaying Spaces and Practical Applicability of Complex Geometries.
CoRR, 2020

Global Graph Curvature.
Proceedings of the Algorithms and Models for the Web Graph - 17th International Workshop, 2020

StochasticRank: Global Optimization of Scale-Free Discrete Functions.
Proceedings of the 37th International Conference on Machine Learning, 2020

Graph-based Nearest Neighbor Search: From Practice to Theory.
Proceedings of the 37th International Conference on Machine Learning, 2020

Embedding Words in Non-Vector Space with Unsupervised Graph Learning.
Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing, 2020

2019
Systematic Analysis of Cluster Similarity Indices: Towards Bias-free Cluster Validation.
CoRR, 2019

Graph-based Nearest Neighbor Search: From Practice to Theory.
CoRR, 2019

Learning Clusters through Information Diffusion.
Proceedings of the World Wide Web Conference, 2019

Community Detection through Likelihood Optimization: In Search of a Sound Model.
Proceedings of the World Wide Web Conference, 2019

Using Synthetic Networks for Parameter Tuning in Community Detection.
Proceedings of the Algorithms and Models for the Web Graph - 16th International Workshop, 2019

A Statistical Test of Heterogeneous Subgraph Densities to Assess Clusterability.
Proceedings of the Learning and Intelligent Optimization - 13th International Conference, 2019

2018
Preferential placement for community structure formation.
Internet Math., 2018

Clustering Properties of Spatial Preferential Attachment Model.
Proceedings of the Algorithms and Models for the Web Graph - 15th International Workshop, 2018

CatBoost: unbiased boosting with categorical features.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

2017
General results on preferential attachment and clustering coefficient.
Optim. Lett., 2017

Assortativity in Generalized Preferential Attachment Models.
Internet Math., 2017

Local Clustering Coefficient in Generalized Preferential Attachment Models.
Internet Math., 2017

Modularity in several random graph models.
Electron. Notes Discret. Math., 2017

Fighting biases with dynamic boosting.
CoRR, 2017

2016
Global Clustering Coefficient in Scale-Free Weighted and Unweighted Networks.
Internet Math., 2016

Recency-based preferential attachment models.
J. Complex Networks, 2016

Publication Date Prediction through Reverse Engineering of the Web.
Proceedings of the Ninth ACM International Conference on Web Search and Data Mining, 2016

Modularity of Complex Networks Models.
Proceedings of the Algorithms and Models for the Web Graph - 13th International Workshop, 2016

2015
What can be Found on the Web and How: A Characterization of Web Browsing Patterns.
Proceedings of the ACM Web Science Conference, 2015

PageRank in Undirected Random Graphs.
Proceedings of the Algorithms and Models for the Web Graph - 12th International Workshop, 2015

Adaptive Caching of Fresh Web Search Results.
Proceedings of the Advances in Information Retrieval, 2015

2014
Global Clustering Coefficient in Scale-Free Networks.
Proceedings of the Algorithms and Models for the Web Graph - 11th International Workshop, 2014

Quick Detection of High-Degree Entities in Large Directed Networks.
Proceedings of the 2014 IEEE International Conference on Data Mining, 2014

Crawling Policies Based on Web Page Popularity Prediction.
Proceedings of the Advances in Information Retrieval, 2014

2013
The Distribution of Second Degrees in the Buckley-Osthus Random Graph Model.
Internet Math., 2013

Generalized Preferential Attachment: Tunable Power-Law Degree Distribution and Clustering Coefficient.
Proceedings of the Algorithms and Models for the Web Graph - 10th International Workshop, 2013

Evolution of the Media Web.
Proceedings of the Algorithms and Models for the Web Graph - 10th International Workshop, 2013

Studying page life patterns in dynamical web.
Proceedings of the 36th International ACM SIGIR conference on research and development in Information Retrieval, 2013

Timely crawling of high-quality ephemeral new content.
Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, 2013

2012
A Model of the Fresh Internet
CoRR, 2012

Empirical validation of the buckley-osthus model for the web host graph: degree and edge distributions.
Proceedings of the 21st ACM International Conference on Information and Knowledge Management, 2012

Prediction of retweet cascade size over time.
Proceedings of the 21st ACM International Conference on Information and Knowledge Management, 2012


  Loading...