Skip to content
GCC AI Research

Search

Results for "martingale"

Martingale-based Verification of Probabilistic Programs

MBZUAI ·

Amir Goharshady from Hong Kong University of Science and Technology presented a talk at MBZUAI on martingale-based verification of probabilistic programs. The talk covered using martingale-based approaches for proving termination and synthesizing cost bounds for probabilistic programs, automating program analysis with template-based methods. He also discussed remaining challenges and open problems in the area. Why it matters: Advances in formal verification and analysis of probabilistic programs are crucial for ensuring the reliability and safety of AI systems that rely on randomization.

The role of applied mathematics in finance

KAUST ·

KAUST's Stochastic Numerics Research Group is developing methods for pricing European options. Their approach, detailed in an upcoming Journal of Computational Finance article, focuses on systematically tuning parameters to achieve accuracy while minimizing computational effort. The goal is to enable automated computation of fair prices for options contracts, similar to how insurance companies determine premiums. Why it matters: This research advances computational finance in the region, potentially improving risk management and investment strategies.

SGD from the Lens of Markov process: An Algorithmic Stability Perspective

MBZUAI ·

A Marie Curie Fellow from Inria and UIUC presented research on stochastic gradient descent (SGD) through the lens of Markov processes, exploring the relationships between heavy-tailed distributions, generalization error, and algorithmic stability. The research challenges existing theories about the monotonic relationship between heavy tails and generalization error. It introduces a unified approach for proving Wasserstein stability bounds in stochastic optimization, applicable to convex and non-convex losses. Why it matters: The work provides novel insights into the theoretical underpinnings of stochastic optimization, relevant to researchers at MBZUAI and other institutions in the region working on machine learning algorithms.

KAUST Ph.D. student wins Society for Industrial and Applied Mathematics award

KAUST ·

KAUST Ph.D. student Chiheb Ben Hammouda won the best poster award at the Society for Industrial and Applied Mathematics Conference on Financial Mathematics & Engineering (FM19) for his work on option pricing under the rough Bergomi model. The winning poster, titled "Hierarchical adaptive sparse grids and quasi-Monte Carlo for option pricing under the rough Bergomi model," details research carried out under the supervision of KAUST Professor Raul Tempone. The research group designed new efficient numerical methods for pricing derivatives under the rough Bergomi model by combining smoothing techniques. Why it matters: This award highlights KAUST's growing expertise in financial mathematics and its contribution to solving complex problems in the field using advanced numerical methods.

Bridging probability and determinism: A new causal discovery method presented at NeurIPS

MBZUAI ·

MBZUAI researchers presented a new causal discovery method at NeurIPS that identifies relationships between deterministic and non-deterministic variables. The method builds directed graphs visualizing relationships between variables, incorporating both probabilistic and deterministic principles. The lead author, Longkang Li, aims to apply causal discovery to healthcare and biology for better understanding of diseases. Why it matters: This research advances the field of causal inference, potentially improving applications in areas like healthcare where understanding complex relationships is critical.

Fast Rates for Maximum Entropy Exploration

MBZUAI ·

This paper addresses exploration in reinforcement learning (RL) in unknown environments with sparse rewards, focusing on maximum entropy exploration. It introduces a game-theoretic algorithm for visitation entropy maximization with improved sample complexity of O(H^3S^2A/ε^2). For trajectory entropy, the paper presents an algorithm with O(poly(S, A, H)/ε) complexity, showing the statistical advantage of regularized MDPs for exploration. Why it matters: The research offers new techniques to reduce the sample complexity of RL, potentially enhancing the efficiency of AI agents in complex environments.

DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information

arXiv ·

This paper introduces DaringFed, a novel dynamic Bayesian persuasion pricing mechanism for online federated learning (OFL) that addresses the challenge of two-sided incomplete information (TII) regarding resources. It formulates the interaction between the server and clients as a dynamic signaling and pricing allocation problem within a Bayesian persuasion game, demonstrating the existence of a unique Bayesian persuasion Nash equilibrium. Evaluations on real and synthetic datasets demonstrate that DaringFed optimizes accuracy and convergence speed and improves the server's utility.

From Descartes to Morin

KAUST ·

Dominique Sciamma, Managing Director at Strate School of Design in France, gave a presentation at KAUST during Enrichment in the Fall of 2017. The title of the presentation was "From Descartes to Morin." The event was held at King Abdullah University of Science and Technology. Why it matters: While the event is dated, KAUST's ongoing enrichment programs contribute to fostering a culture of innovation and knowledge exchange in Saudi Arabia.