1 code implementation • 28 Mar 2024 • Andrii Kliachkin, Eleni Psaroudaki, Jakub Marecek, Dimitris Fotakis
Second, there are multiple measures of fairness of rankings, and optimization-based methods utilizing a single measure of fairness of rankings may produce rankings that are unfair with respect to other measures.
no code implementations • 8 Feb 2024 • Ales Wodecki, Jakub Marecek
We consider the problem of learning local quantum Hamiltonians given copies of their Gibbs state at a known inverse temperature, following Haah et al. [2108. 04842] and Bakshi et al. [arXiv:2310. 02243].
1 code implementation • 25 Jan 2024 • Jiri Nemecek, Tomas Pevny, Jakub Marecek
Explainability of decisions made by AI systems is driven by both recent regulation and user demand.
no code implementations • 22 Nov 2023 • Gilles Bareilles, Johannes Aspman, Jiri Nemecek, Jakub Marecek
Tame functions are a class of nonsmooth, nonconvex functions, which feature in a wide range of applications: functions encountered in the training of deep neural networks with all common activations, value functions of mixed-integer programs, or wave functions of small molecules.
no code implementations • 3 Nov 2023 • Mengjia Niu, Xiaoyu He, Petr Ryšavý, Quan Zhou, Jakub Marecek
Clustering of time series is a well-studied problem, with applications ranging from quantitative, personalized models of metabolism obtained from metabolite concentrations to state discrimination in quantum information theory.
1 code implementation • 17 Oct 2023 • Quan Zhou, Jakub Marecek
Fairness holds a pivotal role in the realm of machine learning, particularly when it comes to addressing groups categorised by sensitive attributes, e. g., gender, race.
no code implementations • 5 Oct 2023 • Johannes Aspman, Georgios Korpas, Jakub Marecek
There has been a great deal of recent interest in binarized neural networks, especially because of their explainability.
1 code implementation • 11 Jun 2023 • Jiri Nemecek, Tomas Pevny, Jakub Marecek
In classification and forecasting with tabular data, one often utilizes tree-based models.
1 code implementation • 12 Sep 2022 • Quan Zhou, Jakub Marecek, Robert N. Shorten
We also show that by exploiting sparsity in the convexifications, we can reduce the run time of our methods considerably.
no code implementations • 3 Sep 2022 • Quan Zhou, Ramen Ghosh, Robert Shorten, Jakub Marecek
In a closed-loop view of the AI system and its users, the equal treatment concerns one pass through the loop.
no code implementations • 12 Jul 2022 • Madeleine Woodburn, Wynita M. Griggs, Jakub Marecek, Robert N. Shorten
With positive results from the initial testing of the proof-of-concept, further development could significantly contribute towards creating safer pedestrian routes through cities, and tackle the societal change that is required to improve female pedestrian safety in the long term.
no code implementations • 23 Jun 2022 • Fabio V. Difonzo, Vyacheslav Kungurtsev, Jakub Marecek
In this paper, we show some foundational results regarding the flow and asymptotic properties of Langevin-type Stochastic Differential Inclusions under assumptions appropriate to the machine-learning settings.
no code implementations • 31 Mar 2022 • Denys I. Bondar, Zakhar Popovych, Kurt Jacobs, Georgios Korpas, Jakub Marecek
Current quantum devices suffer imperfections as a result of fabrication, as well as noise and dissipation as a result of coupling to their immediate environments.
no code implementations • 19 Nov 2021 • Alberto Schiabel, Vyacheslav Kungurtsev, Jakub Marecek
Optimization problems with set submodular objective functions have many real-world applications.
no code implementations • 6 Oct 2021 • Jakub Marecek, Michal Roubalik, Ramen Ghosh, Robert N. Shorten, Fabian R. Wirth
We show that even considering the non-linearity of the alternating-current model, this notion of predictability and fairness can be guaranteed for incrementally input-to-state stable (iISS) controllers, under mild assumptions.
1 code implementation • 4 Jun 2021 • Quan Zhou, Jakub Marecek, Robert N. Shorten
In the process, we introduce a novel notion of subgroup fairness (which we call Inter-fairness), which can be combined with other notions of fairness within each subgroup (called Intra-fairness), and the utility for the customers (Customer-Care) in the objective of the market-clearing problem.
no code implementations • 19 May 2021 • Allahkaram Shafiei, Vyacheslav Kungurtsev, Jakub Marecek
We consider rather a general class of multi-level optimization problems, where a convex objective function is to be minimized subject to constraints of optimality of nested convex optimization problems.
no code implementations • 2 Jan 2021 • Sam D. Allen, Edmund K. Burke, Jakub Marecek
Current integer programming solvers fail to decide whether 12 unit cubes can be packed into a 1x1x11 box within an hour using the natural relaxation of Chen/Padberg.
no code implementations • 1 Nov 2020 • Jakub Marecek
There has been much recent interest in screening populations for an infectious disease.
no code implementations • 31 Jul 2020 • Ramen Ghosh, Jakub Marecek, Wynita M. Griggs, Matheus Souza, Robert N. Shorten
We consider the design of distributed algorithms that govern the manner in which agents contribute to a social sensing platform.
no code implementations • 12 Jun 2020 • Quan Zhou, Jakub Marecek, Robert N. Shorten
In machine learning, training data often capture the behaviour of multiple subgroups of some underlying human population.
1 code implementation • 4 Feb 2020 • Quan Zhou, Jakub Marecek
There has been much recent progress in forecasting the next observation of a linear dynamical system (LDS), which is known as the improper learning, as well as in the estimation of its system matrices, which is known as the proper learning of LDS.
no code implementations • 9 Dec 2019 • Albert Akhriev, Jakub Marecek
Many real-world monitoring and surveillance applications require non-trivial anomaly detection to be run in the streaming model.
no code implementations • 16 Sep 2019 • Olivier Massicot, Jakub Marecek
Time-varying non-convex continuous-valued non-linear constrained optimization is a fundamental problem.
no code implementations • 23 Jun 2019 • Wann-Jiun Ma, Jakub Marecek, Martin Mevissen
There has been much recent interest in hierarchies of progressively stronger convexifications of polynomial optimisation problems (POP).
1 code implementation • 22 Oct 2018 • Philipp Haehnel, Jakub Marecek, Julien Monteil, Fearghal O'Donncha
Across numerous applications, forecasting relies on numerical solvers for partial differential equations (PDEs).
1 code implementation • AAAI 2019 • Mark Kozdoba, Jakub Marecek, Tigran Tchrakian, Shie Mannor
Based on this insight, we devise an on-line algorithm for improper learning of a linear dynamical system (LDS), which considers only a few most recent observations.
1 code implementation • 10 Sep 2018 • Albert Akhriev, Jakub Marecek, Andrea Simonetto
In tracking of time-varying low-rank models of time-varying matrices, we present a method robust to both uniformly-distributed measurement noise and arbitrarily-distributed ``sparse'' noise.
no code implementations • 3 Aug 2018 • Jakub Marecek, Tigran Tchrakian
We consider a setting, where the output of a linear dynamical system (LDS) is, with an unknown but fixed probability, replaced by noise.
no code implementations • 12 Apr 2016 • Jonathan Epperlein, Jakub Marecek
Many analyses of resource-allocation problems employ simplistic models of the population.
no code implementations • 25 Jan 2016 • Jakub Marecek, Robert Shorten, Jia Yuan Yu
For vehicle sharing schemes, where drop-off positions are not fixed, we propose a pricing scheme, where the price depends in part on the distance between where a vehicle is being dropped off and where the closest shared vehicle is parked.
1 code implementation • 5 Dec 2014 • Catherine Kerr, Terri Hoare, Paula Carroll, Jakub Marecek
The extraction and understanding of temporal events and their relations are major challenges in natural language processing.
no code implementations • 11 Aug 2014 • Jakub Marecek, Peter Richtarik, Martin Takac
Matrix completion under interval uncertainty can be cast as matrix completion with element-wise box constraints.
no code implementations • 9 Apr 2014 • Jakub Marecek, Robert Shorten, Jia Yuan Yu
A central authority has up-to-date knowledge of the congestion across all resources and uses randomisation to provide a scalar or an interval for each resource at each time.