Yury Maximov

Aleksandr Bulkin

IEEE Control. Syst. Lett., 2024

Cascading Blackout Severity Prediction with Statistically-Augmented Graph Neural Networks.

[BibT_eX]

[DOI]

CoRR, 2024

Climate Change Impact on Agricultural Land Suitability: An Interpretable Machine Learning-Based Eurasia Case Study.

[BibT_eX]

[DOI]

Valeriy Shevchenko

IEEE Access, 2024

2023

GP CC-OPF: Gaussian Process based optimization tool for Chance-Constrained Optimal Power Flow.

[BibT_eX]

[DOI]

Ognjen Kundacina

Softw. Impacts, May, 2023

CMIP X-MOS: Improving Climate Models with Extreme Model Output Statistics.

[BibT_eX]

[DOI]

Vsevolod Morozov

Artem Galliamov

Antonina Kurdukova

CoRR, 2023

Climate Change Impact on Agricultural Land Suitability: An Interpretable Machine Learning-Based Eurasia Case Study.

[BibT_eX]

[DOI]

Valeriy Shevchenko

Daria Taniushkina

CoRR, 2023

GP CC-OPF: Gaussian Process based optimization tool for Chance-Constrained Optimal Power Flow.

[BibT_eX]

[DOI]

Ognjen Kundacina

CoRR, 2023

Long-Term Hail Risk Assessment with Deep Neural Networks.

[BibT_eX]

[DOI]

Proceedings of the Advances in Computational Intelligence, 2023

2022

Efficient numerical methods to solve sparse linear equations with application to PageRank.

[BibT_eX]

[DOI]

Anton Anikin

Alexander V. Gasnikov

Optim. Methods Softw., 2022

Power Grid Reliability Estimation via Adaptive Importance Sampling.

[BibT_eX]

[DOI]

IEEE Control. Syst. Lett., 2022

Long-term hail risk assessment with deep neural networks.

[BibT_eX]

[DOI]

CoRR, 2022

Ranking-Based Physics-Informed Line Failure Detection in Power Grids.

[BibT_eX]

[DOI]

CoRR, 2022

Predicting spatial distribution of Palmer Drought Severity Index.

[BibT_eX]

[DOI]

Vsevolod Grabar

Alexey Zaytsev

CoRR, 2022

Data-Driven Chance Constrained AC-OPF using Hybrid Sparse Gaussian Processes.

[BibT_eX]

[DOI]

CoRR, 2022

Data-Driven Stochastic AC-OPF using Gaussian Processes.

[BibT_eX]

[DOI]

CoRR, 2022

Learning over No-Preferred and Preferred Sequence of Items for Robust Recommendation (Extended Abstract).

[BibT_eX]

[DOI]

CoRR, 2022

Self-Training: A Survey.

[BibT_eX]

[DOI]

CoRR, 2022

Recommender Systems: When Memory Matters.

[BibT_eX]

[DOI]

Proceedings of the Advances in Information Retrieval, 2022

2021

Learning over No-Preferred and Preferred Sequence of Items for Robust Recommendation.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2021

User preference and embedding learning with implicit feedback for recommender systems.

[BibT_eX]

[DOI]

Data Min. Knowl. Discov., 2021

2020

Learning over no-Preferred and Preferred Sequence of items for Robust Recommendation.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Tractable Minor-free Generalization of Planar Zero-field Ising Models.

[BibT_eX]

[DOI]

CoRR, 2019

A New Family of Tractable Ising Models.

[BibT_eX]

[DOI]

CoRR, 2019

Learning a Generator Model from Terminal Bus Data.

[BibT_eX]

[DOI]

CoRR, 2019

Sequential Learning over Implicit Feedback for Robust Large-Scale Recommender Systems.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2019

Entropy-Penalized Semidefinite Programming.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Inference and Sampling of $K_33$-free Ising Models.

[BibT_eX]

[DOI]

Misha Chertkov

Proceedings of the 36th International Conference on Machine Learning, 2019

2018

Rademacher Complexity Bounds for a Penalized Multi-class Semi-supervised Algorithm.

[BibT_eX]

[DOI]

Zaïd Harchaoui

J. Artif. Intell. Res., 2018

Inference and Sampling of K<sub>33</sub>-free Ising Models.

[BibT_eX]

[DOI]

CoRR, 2018

Gauges, Loops, and Polynomials for Partition Functions of Graphical Models.

[BibT_eX]

[DOI]

CoRR, 2018

Rademacher Complexity Bounds for a Penalized Multi-class Semi-supervised Algorithm (Extended Abstract).

[BibT_eX]

[DOI]

Zaïd Harchaoui

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Heterogeneous Dyadic Multi-task Learning with Implicit Feedback.

[BibT_eX]

[DOI]

Proceedings of the Neural Information Processing - 25th International Conference, 2018

Belief Propagation Min-Sum Algorithm for Generalized Min-Cost Network Flow.

[BibT_eX]

[DOI]

Andrii Riazanov

Proceedings of the 2018 Annual American Control Conference, 2018

2017

Importance sampling the union of rare events with an application to power systems analysis.

[BibT_eX]

[DOI]

Art B. Owen

CoRR, 2017

Representation Learning and Pairwise Ranking for Implicit and Explicit Feedback in Recommendation Systems.

[BibT_eX]

[DOI]

CoRR, 2017

Aggressive Sampling for Multi-class to Binary Reduction with Applications to Text Classification.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Efficient rank minimization to tighten semidefinite programming for unconstrained binary quadratic optimization.

[BibT_eX]

[DOI]

Roman Pogodin

Mikhail Krechetov

Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2016

Rademacher Complexity Bounds for a Penalized Multiclass Semi-Supervised Algorithm.

[BibT_eX]

[DOI]

Zaïd Harchaoui

CoRR, 2016

2015

Tight Risk Bounds for Multi-Class Margin Classifiers.

[BibT_eX]

[DOI]