Results 171 to 180 of about 9,520,135 (306)
Progressive Power Homotopy for Non-convex Optimization
We propose a novel first-order method for non-convex optimization of the form $\max_{\bm{w}\in\mathbb{R}^d}\mathbb{E}_{\bm{x}\sim\mathcal{D}}[f_{\bm{w}}(\bm{x})]$, termed Progressive Power Homotopy (Prog-PowerHP). The method applies stochastic gradient ascent to a surrogate objective obtained by first performing a power transformation and then Gaussian
openaire +3 more sources
Robust Solutions of Optimization Problems Affected by Uncertain Probabilities [PDF]
In this paper we focus on robust linear optimization problems with uncertainty regions defined by ø-divergences (for example, chi-squared, Hellinger, Kullback-Leibler).
De Waegenaere, A.M.B. +4 more
core
Machine‐Learning Framework for Designing Stable Interfaces in All‐Solid‐State Lithium‐Ion Batteries
A data‐driven strategy is developed to discover coating materials for all‐solid‐state lithium batteries. Using calculations of interfacial reactivity, unsupervised pattern recognition, and machine‐learning prediction, the study identifies low‐reactivity compositional patterns and screens new lithium‐based oxide and polyanion candidates, extending ...
Sehyeok Park +4 more
wiley +1 more source
Optimality Conditions for Semivectorial Bilevel Convex Optimal Control Problems [PDF]
We present optimality conditions for bilevel optimal control problems where the upper level, to be solved by a leader, is a scalar optimal control problem and the lower level, to be solved by several followers, is a multiobjective convex optimal control ...
Henry Bonnel, Jacqueline Morgan
core
Autonomous laboratories can now synthesize materials faster than experts can interpret the resulting diffraction data. A probabilistic framework combines refinement‐fit metrics with large language model‐derived chemical reasoning to rank competing phase interpretations and flag those unsuitable for autonomous use.
Olympia Dartsi +7 more
wiley +1 more source
Inverse problems in imaging are sometimes cast in the form of a non-smooth optimization problem involving an objective function that is the combination of a data misfit term and regularizing penalty or constraint.
Loris, Ignace
core
A Generative Neuro‐Symbolic AI for Protein Sequence Design
We introduce EffieDes, a neuro‐symbolic framework coupling deep learning‐based fitness landscape parameterization with exact automated reasoning. Unlike greedy sampling, EffieDes identifies sequences that globally optimize fitness while satisfying intricate design constraints.
Marianne Defresne +12 more
wiley +1 more source
On s-additive robust representation of convex risk measures for unbounded financial positions in the presence of uncertainty about the market model [PDF]
Recently, Frittelli and Scandolo ([9]) extend the notion of risk measures, originally introduced by Artzner, Delbaen, Eber and Heath ([1]), to the risk assessment of abstract financial positions, including pay offs spread over different dates, where ...
Volker Krätschmer
core
StackingNet: Collective Inference Across Independent AI Foundation Models
ABSTRACT Artificial intelligence (AI) built on large foundation models has transformed language understanding, computer vision, and reasoning, yet these systems remain isolated and cannot readily share their capabilities. Coordinating the complementary strengths of independently developed, black‐box foundation models is essential for trustworthy ...
Siyang Li +4 more
wiley +1 more source
Non-convex optimization for inverse problem solving in computer-generated holography. [PDF]
Sui X, He Z, Chu D, Cao L.
europepmc +1 more source

