New model shows negative resilience can improve trading efficiency.
problem Optimal trade execution in limit order books with negative resilience.
method Stochastic order book model with negative resilience.
result Negative resilience can lead to more efficient trading.
New framework for resilient bi-criteria optimization under noisy feedback.
problem Bi-criteria combinatorial optimization with noisy function evaluations.
method Introducing ( α , β , δ , e x t t t N ) (α,β,δ, exttt{N}) ( α , β , δ , e x ttt N ) -resilience and developing a black-box framework. result Achieves sublinear regret and constraint violation for bi-criteria bandit problems.
This paper uses robust optimization to analyze supply chain resilience.
problem Supply chain resilience analysis of multi-modal logistics networks.
method Robust optimization with budget-of-uncertainty.
result Interactive effects of network size, disruption scale, and degree on resilience.
CyBeR-0 optimizes federated learning with Byzantine resilience and reduced communication costs.
problem Byzantine attacks and communication inefficiency in federated learning.
method Transformed robust aggregation for zero-order optimization under client heterogeneity.
result CyBeR-0 achieves stable performance with minimal communication costs and reduced memory usage.
Automated design of resilient, efficient DNNs for hardware.
problem Designing reliable and efficient DNNs for hardware.
method Evolutionary optimization technique for DNN architecture design.
result Strong correlation between predicted and actual error resilience.
Study optimal trade execution in markets with price impact and resilience.
problem Optimal trade execution in illiquid markets with price impact and resilience.
method Modelled as a three-dimensional system of BSDEs with singular terminal condition, proving existence and uniqueness of solution.
result Characterized optimal strategy and value function in terms of BSDE solution.
Study optimal stock purchases under fluctuating market resilience.
problem Optimal stock purchases over time with varying market resilience.
method Model market resilience and liquidity variations, solve optimization problem.
result Unique optimal execution strategy found.
We consider optimal execution strategies for block market orders placed in a limit order book (LOB). We build on the resilience model proposed by Obizhaeva and Wang (2005) but allow for a general shape of the LOB defined via a given density function. Thus, we can allow for empirically observed LOB shapes and obtain a n…
This paper develops a stochastic learning-optimization model for resilient automotive supply chains.
problem Supply chain disruptions and volatile demand pose challenges to the UK automotive industry.
method Integrates Bayesian inference with inventory optimization for a two-echelon system subject to stochastic demand and disruptions.
result The integrated approach achieves significant cost reductions and improved resilience during disruptions.
New algorithm resists attacks, deletions, and failures in sequential system optimization.
problem Resilient sequential design in adversarial environments.
method First scalable algorithm for system-wide resiliency, adaptiveness, and provable approximation.
result Guaranteed solution close to optimal for monotone objective functions.
This paper tackles resilient matroid-constrained problems in control and sensing with scalable algorithms.
problem Resilient matroid-constrained problems in control and sensing with failures.
method Develops scalable algorithms for resilient matroid-constrained problems with provable approximation bounds.
result First scalable algorithm for system-wide resiliency in matroid-constrained problems.
Predictive Q-learning algorithm for IoT networks with human operators.
problem Resilient and predictive actions for IoT networks with faulty components.
method Predictive and resilient Q-learning algorithm considering historical data and human operator feedback.
result Optimal scheduling policies avoiding attacked locations and faults.
Method creates resilient classifiers by focusing on highly predictive features.
problem Adversarial attacks exploit weakly correlated features learned during training.
method Resilient feature engineering to prioritize highly predictive features.
result Serial and Parallel Composition Resilience theorems support the design of resilient classifiers.
Paper introduces a new index to measure financial and workplace resilience of firms.
problem Corporate resilience and its types in turbulent markets.
method Quantitative analysis of earnings expectations and implied discount rates.
result Evidence of workplace resilience amplification by financial status in the COVID-19 era.
This paper introduces resilient constrained learning to adapt learning constraints while solving machine learning tasks.
problem Adapting machine learning solutions to satisfy multiple requirements beyond accuracy.
method Adapts learning constraints during training by balancing performance gains against a user-defined cost of relaxation.
result Shows conditions and introduces a practical algorithm to compute the balance, with approximation and generalization guarantees.
Measures financial resilience using BSDEs and their properties.
problem Measuring financial resilience in dynamic risk environments.
method Developed stochastic calculus for BSDEs with jumps, revealing resilience rate as expectation of generator.
result Resilience rate can be represented as expectation of BSDE generator, revealing properties of dynamic risk measures.
Mitigates faults in DNNs by clipping activation values, improving their resilience.
problem Fault tolerance of DNNs in safety-critical applications.
method Clipping activation functions to reduce impact of faulty weights.
result Significant improvement in classification accuracy (68.92%) for fault mitigation.
Noise-resilient optimization on noisy quantum computers.
problem Noise's impact on hybrid quantum-classical optimization.
method Iterative quantum circuit with noise consideration, using Quantum Fisher Information bound.
result Algorithm robustness against different noise strengths.
COMRADE is a communication-efficient, Byzantine-resilient second-order optimization algorithm.
problem Byzantine failures in distributed optimization.
method COMRADE is a communication-efficient, second-order optimization algorithm that uses a simple norm-based thresholding rule to filter out Byzantine workers.
result COMRADE achieves linear-quadratic convergence and is robust against Byzantine workers.
This paper defines resilience in knowledge graph embeddings and surveys existing works.
problem Challenges in knowledge graph embedding models, including noise, missing information, distribution shift, and adversarial attacks.
method Unified definition of resilience, formalization in the context of knowledge graphs, systematic survey of existing works.
result Most existing works focus on robustness, leaving other aspects of resilience unexplored.
Python tool assesses European agricultural production resilience.
problem Estimating resilience of European agricultural production systems.
method Python software to compute annual production resilience indicator.
result Demonstrates resilience of European agricultural production.
This paper measures financial market resilience in China and identifies key uncertainties.
problem Measuring financial market resilience in China.
method Quantitative analysis of total financial market and sub-markets, Diebold-Yilmaz connectedness approach.
result Financial market resilience in China is event-driven and influenced by geopolitical risks, economic and trade policy uncertainty, and U.S.-China tensions.
Study proposes a new resilience metric for stock market performance analysis.
problem Quantifying resilience cycles in stock market performance.
method Systems-oriented approach with Robustness Range and Elasticity Threshold.
result New metric quantifies non-linear resilience cycles in stock markets.
The resilience of low-degree Rademacher chaos is studied, providing probabilistic lower bounds.
problem Understanding how much a Rademacher chaos can withstand adversarial sign-flips without significant probability changes.
method Probabilistic lower-bound guarantees for the resilience of Rademacher chaos of arbitrary degree.
result Probabilistic lower-bound guarantees for the resilience of Rademacher chaos of arbitrary degree, especially meaningful for constant degree.
In order-driven markets, limit-order book (LOB) resiliency is an important microscopic indicator of market quality when the order book is hit by a liquidity shock and plays an essential role in the design of optimal submission strategies of large orders. However, the evolutionary behavior of LOB resilience around liqui…
This study develops a dynamic inverse optimization framework to recover hidden, time-varying preferences from observed allocation trajectories.
problem The gap between classical optimization theory and real-world practice, especially in the presence of drift and shocks.
method Dynamic inverse optimization framework using a drift-aware estimator grounded in convex analysis and online learning theory.
result Sharp static and dynamic regret bounds for the framework, demonstrating its responsiveness to gradual drift and sudden shocks.
Proposes resilience metrics for large blackout costs with logarithmic resilience.
problem Large variations in blackout costs make estimating risk impractical.
method Uses mean of log of large blackout costs, tail slope index, and frequency.
result Solves problems of heavy tail and large variations in blackout costs.
RESIST improves decentralized learning resilience against MITM attacks.
problem Decentralized learning's vulnerability to MITM attacks.
method Multistep consensus gradient descent framework with robust statistics-based screening methods.
result Achieves algorithmic and statistical convergence for various ERM problems.
Framework for efficient statistical estimation with privacy guarantees.
problem Statistical estimation problems with differential privacy constraints.
method High-dimensional Propose-Test-Release (HPTR) framework combining exponential mechanism, robust statistics, and resilience.
result Near-optimal utility guarantees and tight local sensitivity bounds for various statistical problems.
Robots gather information resiliently despite failures and attacks.
problem Resilient information gathering in adversarial or failure-prone environments.
method First scalable algorithm for minimal communication, system-wide resiliency, and provable approximation performance.
result Algorithm ensures optimal or near-optimal solutions for any number of failures and attacks.
Two algorithms improve federated learning efficiency and resilience.
problem Scalability issues in federated learning due to communication, privacy, and Byzantine attacks.
method Proposes two algorithms, Ada-StoSign and β β β -StoSign, that compress gradients into bit vectors to reduce communication. result Ada-StoSign converges with a rate of O ( log T / T + 1 / M ) O(\log T/\sqrt{T} + 1/\sqrt{M}) O ( log T / T + 1/ M ) and outperforms existing methods. TensorHyper-VQC improves VQC scalability and robustness.
problem Scalability and noise sensitivity in VQC.
method Tensor-train-guided hypernetwork framework.
result TensorHyper-VQC achieves superior performance and robust noise tolerance.
This paper optimizes cybersecurity resource allocation in networks with heterogeneous attacker and defender valuations.
problem Optimizing cybersecurity resource allocation in networks with heterogeneous attacker and defender valuations.
method Combining strategic behavior of players with contagion dynamics, a method is extended to determine optimal resource allocation based on simple network metrics weighted by risk profiles.
result The asymmetry between attacker and defender valuations drives optimal attack and defense strategies, shaping system resilience.
Stocks of more resilient firms outperformed during the pandemic, reflecting disaster risk.
problem The impact of social distancing on firms' operations and stock performance.
method Cross-sectional analysis of firms' resilience and stock performance, controlling for risk factors.
result Stocks of more resilient firms are expected to yield significantly lower returns than less resilient ones, reflecting disaster risk.
Framework improves resilience in operations through joint long-term and short-term decision-making.
problem Resilient operations in global markets require adaptive decision rules.
method Developed a two-timescale hierarchical reinforcement learning framework.
result Framework increases mean profit by 9.2% under joint demand-supply shocks and 11.8% under prolonged shocks.
Enhances resilience evaluation by using dynamic convex risk measures.
problem Capturing the full risk profile of financial positions under adverse conditions.
method Introduces a new resilience evaluation method using dynamic convex risk measures.
result Shows that the resilience evaluation can distinguish between positions with the same expected recovery but different conditional risk profiles.
This work reveals symmetries in quantum circuits and develops a noise-aware optimization method.
problem Understanding and optimizing the cost landscape of parametrized quantum circuits.
method Analytical proof of symmetries and their resilience to noise, followed by the development of SYMH optimization method.
result Symmetries in PQCs lead to degeneracy in the cost landscape and can be exploited to improve optimization under noise.
ResiliNet improves distributed neural network inference resilience.
problem Physical node failures in distributed neural networks cause performance drops.
method Skip hyperconnection and failout technique.
result ResiliNet provides inference resiliency for distributed neural networks.
Paper benchmarks DRL policies' resilience to state transitions.
problem Measuring DRL policies' resilience to state perturbations.
method Disentangled representation learning and RL-based techniques.
result Demonstrated feasibility of resilience benchmarking in DQN, A2C, and PPO2.
New method quantifies resilience of electric distribution systems from historical data.
problem Large blackouts caused by extreme winds have significant costs and impacts.
method Formulate large event risk from utility outage data, quantify resilience improvements through investments.
result Investments in wind hardening and faster restoration can reduce the probability of large cost events.
Paper develops Byzantine-resilient algorithms for decentralized learning.
problem Vulnerability of distributed learning to Byzantine attacks.
method Dual approach for decentralized optimization.
result Convergence guarantees and experimental validation of the proposed algorithm.
We consider a broker who has to place a large order which consumes a sizable part of average daily trading volume. The broker's aim is thus to minimize execution costs he incurs from the adverse impact of his trades on market prices. By contrast to the previous literature, see, e.g., Obizhaeva and Wang (2005), Predoiu,…
Byrd-SAGA reduces variance to robustify SGD against Byzantine attacks.
problem Learning over networks with malicious Byzantine attacks.
method Byrd-SAGA uses geometric median for robust aggregation of corrected stochastic gradients.
result Byrd-SAGA achieves provably linear convergence to optimal solution in the presence of Byzantine workers.
Paper tackles Byzantine resilience in distributed multi-task learning.
problem Resilience of distributed algorithms in the presence of Byzantine agents.
method Online weight assignment rule based on accumulated loss and filtering.
result Aggregation with proposed weight assignment rule improves expected regret.
Small stocks drive market crashes by suppressing resilience.
problem The single-security price limit exacerbates market panic during crashes.
method Simplified dynamic model on networks of investors and stocks, empirical verification.
result Unexpected linear association between price limit and critical market confidence.
Study reveals resilience of Chinese guarantee network during financial crisis and stimulus.
problem Limited knowledge about guarantee network dynamics during financial downturn.
method Analyzed comprehensive bank loan dataset covering 80% of total loans in China.
result Guarantee network became smaller, less connected, and more stable during financial crisis.
Improved deep neural network generalization through noise resilience.
problem Understanding and predicting generalization error of deep neural networks.
method Noise resilience measures to predict generalization error.
result Secured 5th position in the PGDL competition at NeurIPS 2020.
A methodology for resilience analysis of Capsule Networks under approximation errors.
problem Resilience of Capsule Networks under approximation errors.
method Modeling and analyzing approximation errors in Capsule Networks' inference.
result Capsule Networks are more resilient to errors during dynamic routing than other stages.