Results 21 to 30 of about 342 (117)
It is well known that there have been many numerical algorithms for solving nonsmooth minimax problems, numerical algorithms for nonsmooth minimax problems with joint linear constraints are very rare. This paper aims to discuss optimality conditions and develop practical numerical algorithms for minimax problems with joint linear constraints.
Yu-Hong Dai, Jiani Wang, Liwei Zhang
openaire +3 more sources
Playing in the Dark: Invisible Chess as a Laboratory for Strategic AI
This paper shows that strategic AI evaluated on perfect‐information benchmarks can be brittle in real adversarial settings. By using invisible chess as a benchmark for hidden state and deception, it argues for stricter testing, human oversight, and more cautious governance of high‐stakes AI systems.
Paolo Ciancarini
wiley +1 more source
Hidden Markov graphical models with state‐dependent generalized hyperbolic distributions
Abstract In this article, we develop a novel hidden Markov graphical model to investigate time‐varying interconnectedness between different financial markets. To identify conditional correlation structures under varying market conditions and accommodate shape features embedded in financial time series, we rely upon the generalized hyperbolic family of ...
Beatrice Foroni +2 more
wiley +1 more source
Generative Models in Inorganic Crystals Discovery and Inverse Design
Generative inverse‐design samples from the vast inorganic crystal design space by starting from target properties such as band gap, stability, and ion transport. This Review examines the representations, generative models, and validation workflows needed to translate candidate structures into stable, potentially synthesizable materials for applications
Tao Li +5 more
wiley +1 more source
Computing Skinning Weights via Convex Duality
We present an alternate optimization method to compute bounded biharmonic skinning weights. Our method relies on a dual formulation, which can be optimized with a nonnegative linear least squares setup. Abstract We study the problem of optimising for skinning weights through the lens of convex duality.
J. Solomon, O. Stein
wiley +1 more source
A Non‐Parametric Framework for Correlation Functions on Product Metric Spaces
Summary We propose a non‐parametric framework for analysing data defined over products of metric spaces, a versatile class encountered in various fields. This framework accommodates non‐stationarity and seasonality and is applicable to both local and global domains, such as the Earth's surface, as well as domains evolving over linear time or time ...
Pier Giovanni Bissiri +3 more
wiley +1 more source
A Note on Local Polynomial Regression for Time Series in Banach Spaces
ABSTRACT This work extends local polynomial regression to Banach space‐valued time series for estimating smoothly varying means and their derivatives in non‐stationary data. The asymptotic properties of both the standard and bias‐reduced Jackknife estimators are analyzed under mild moment conditions, establishing their convergence rates.
Florian Heinrichs
wiley +1 more source
Testing Distributional Granger Causality With Entropic Optimal Transport
ABSTRACT We develop a novel nonparametric test for Granger causality in distribution based on entropic optimal transport. Unlike classical mean‐based approaches, the proposed method directly compares the full conditional distributions of a response variable with and without the history of a candidate predictor.
Tao Wang
wiley +1 more source
ABSTRACT Greenwashing persists not only because firms are motivated to inflate their sustainability claims but also because consumers, limited by bounded rationality, depend on heuristics when overwhelmed with information. This conceptual article uses behavioral economics to connect specific types of greenwashing and greenhushing to affect ...
Luca Lancini
wiley +1 more source
Adaptive Estimation for Weakly Dependent Functional Times Series
ABSTRACT We propose adaptive mean and autocovariance function estimators for stationary functional time series under 𝕃p−m‐approximability assumptions. These estimators are designed to adapt to the regularity of the curves and to accommodate both sparse and dense data designs.
Hassan Maissoro +2 more
wiley +1 more source

