On the Role of Geometry in Solving Variational Inequalities
The geometry of constraints in variational inequalities (VIs) plays a central role in applications ranging fro
Category
最適化、確率統計、解釈可能性など、手法選定や評価設計の土台になる理論を扱います。
The geometry of constraints in variational inequalities (VIs) plays a central role in applications ranging fro
Koopman representations describe nonlinear dynamics through linear evolution in a transformed space, offering
Therapeutic antibody development is often framed as comprising two discrete stages: initial discovery of novel
The geometry of constraints in variational inequalities (VIs) plays a central role in applications ranging fro
Koopman representations describe nonlinear dynamics through linear evolution in a transformed space, offering
Therapeutic antibody development is often framed as comprising two discrete stages: initial discovery of novel
The geometry of constraints in variational inequalities (VIs) plays a central role in applications ranging fro
Koopman representations describe nonlinear dynamics through linear evolution in a transformed space, offering
Therapeutic antibody development is often framed as comprising two discrete stages: initial discovery of novel
We present a variational functional neural network (vfNN) algorithm that optimizes physically motivated contin
As control engineering is applied to increasingly complex systems, learning-based control, which uses empirica
Training models over data distributed across edge devices presents a trade-off: centralizing data simplifies t
Design thinking is widely taught as an iterative loop of ideation, prototyping, and testing, yet conditions un
A staged search must decide which candidate to advance next and when to stop. Some observations only inform la
Recent advances in Artificial Intelligence (AI), particularly large-scale deep learning, have been driven by m
Language model agents often struggle with complex tasks even when equipped with expert-written skills. Such sk
Classical Bayesian persuasion assumes that an information designer can condition signals on the entire state.
Backpropagation is the standard method for computing the gradients that train neural networks, but it is usual
We study minimum-norm interpolation in weighted variation spaces generated by ReLU$^s$ ridge functions on the
Instance-dependent limits for bandit regret, sequential tests, best-arm identification and Markov decision pro
Physics-informed Gaussian process (GP) methods provide a probabilistic framework for PDE solving. Existing app
Recent years have seen multiple impressive results in visual-inertial odometry (VIO) techniques, by which accu
Flexible robot links challenge the rigid-body assumption, making joint measurements alone insufficient for acc
Kidney exchange programs enable patients with incompatible living donors to receive transplants by exchanging
We study the problem of fair ranking in recommender systems. We provide a formal probabilistic framework in wh
Automated mechanism design has enabled the learning of complex auction mechanisms using neural networks. Howev
This work considers projection-free online learning algorithms with linear minimization oracles for handling t
We present general upper and lower bounds on the optimal error exponent for the Active Simple Hypothesis Testi
Besides domination-based algorithms such as the NSGA-II, the decomposition-based MOEA/D is one of the most pop
Follow the regularized leader (FTRL) is a foundational algorithm in online learning whose regret properties ha
Generalized circuits are a fundamental tool for establishing PPAD-hardness and membership of approximate equil
We investigate k-submodular cover problem with a matroid constraint on an n-element ground set V , which seeks
Game theory identifies when a strategic action should be accepted, but not how long a live, language-based cou
In this work, we develop a zeroth-order (ZO) method that estimates the gradient with minimal bias and variance
We study the optimal design of a self-financing event, a problem that requires balancing the recruitment of co
A new adaptive restart rule for Genetic Algorithms (GAs) is considered. The rule is based on the Schnabel Cens
We examine the value of information in extensive-form decision problems: the largest multiplicative gain that
We study the complexity of computing approximate first-order Nash equilibria in min-max optimization problems
We revisit an established Quantum Control objective, characterize its exact local metric geometry, and reposit
Constrained Reinforcement Learning has recently gained increasing attention in the field of Safe Autonomous Dr
This paper introduces a hybrid joint-selective optimization (HJSO) framework for large-scale numerical problem
We study the minimum number of hidden neurons required for arbitrary-accuracy approximation of multivariate Hö