Zobrazeno 1 - 10
of 1 860
pro vyhledávání: '"P Parys"'
We establish a connection between distributionally robust optimization (DRO) and classical robust statistics. We demonstrate that this connection arises naturally in the context of estimation under data corruption, where the goal is to construct ``mi
Externí odkaz:
http://arxiv.org/abs/2410.14008
Autor:
Du-Hwa Lee, Ho-Seok Lee, Min-Soo Choi, Katarzyna Parys, Kaori Honda, Yasumitsu Kondoh, Jung-Min Lee, Natalie Edelbacher, Geon Heo, Balaji Enugutti, Hiroyuki Osada, Ken Shirasu, Youssef Belkhadir
Publikováno v:
Nature Communications, Vol 15, Iss 1, Pp 1-14 (2024)
Abstract Receptor kinase (RK) families process information from small molecules, short peptides, or glycan ligands to regulate core cellular pathways in plants. To date, whether individual plant RKs are capable of processing signals from distinct typ
Externí odkaz:
https://doaj.org/article/c58ea9ad78904a4195deec2c1ce43764
We present our collaboration with Thales Canada Inc, the largest provider of communication-based train control (CBTC) systems worldwide. We study the problem of designing energy-optimal timetables in metro railway networks to minimize the effective e
Externí odkaz:
http://arxiv.org/abs/2309.05489
In data-driven optimization, sample average approximation (SAA) is known to suffer from the so-called optimizer's curse that causes an over-optimistic evaluation of the solution performance. We argue that a special type of distributionallly robust op
Externí odkaz:
http://arxiv.org/abs/2306.14041
We propose a data-driven technique to automatically learn the uncertainty sets in robust optimization. Our method reshapes the uncertainty sets by minimizing the expected performance across a family of problems subject to guaranteeing constraint sati
Externí odkaz:
http://arxiv.org/abs/2305.19225
Autor:
Parys, Paweł, Wiącek, Aleksander
We improve the complexity of solving parity games (with priorities in vertices) for $d={\omega}(\log n)$ by a factor of ${\theta}(d^2)$: the best complexity known to date was $O(mdn^{1.45+\log_2(d/\log_2(n))})$, while we obtain $O(mn^{1.45+\log_2(d/\
Externí odkaz:
http://arxiv.org/abs/2305.00308
The Rabin tree theorem yields an algorithm to solve the satisfiability problem for monadic second-order logic over infinite trees. Here we solve the probabilistic variant of this problem. Namely, we show how to compute the probability that a randomly
Externí odkaz:
http://arxiv.org/abs/2304.12158
Simulations of high-density deuterium plasmas in a lower single-null magnetic configuration based on a TCV discharge are presented. We evolve the dynamics of three charged species (electrons, D$^{+}$ and D$_{2}^{+}$), interacting with two neutrals sp
Externí odkaz:
http://arxiv.org/abs/2304.09687
Recent work have demonstrated that robustness (to "corruption") can be at odds with generalization. Adversarial training, for instance, aims to reduce the problematic susceptibility of modern neural networks to small data perturbations. Surprisingly,
Externí odkaz:
http://arxiv.org/abs/2303.02251
Autor:
Shireen Shehzad Bhamani, An-Sofie Van Parys, David Arthur, Nicole Letourneau, Gail Wagnild, Olivier Degomme
Publikováno v:
BMC Pregnancy and Childbirth, Vol 24, Iss 1, Pp 1-17 (2024)
Abstract Background The negative impact of adverse perinatal mental health extends beyond the mother and child; therefore, it is essential to make an early intervention for the management of mental illness during pregnancy. Resilience-building interv
Externí odkaz:
https://doaj.org/article/f9c335607d2d4fb38a193297b5ec2602