Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

3571106141 · May 202619922001200920172026
48 results for Sion's theorem

Paper proves Sion's theorem in geodesic spaces and develops a Riemannian extragradient method.

problem Understanding saddle points in nonconvex-nonconcave minimax problems.
method Geodesic metric space version of Sion's theorem and Riemannian extragradient method.
result Developed a Riemannian extragradient algorithm for smooth minimax problems.

Study proves value of non-Markovian games with partial, asymmetric info.

problem Value of non-Markovian Dynkin games with partial and asymmetric information.
method Probabilistic and functional analytic approach based on Sion's min-max theorem.
result Existence of optimal strategies for both players in randomised stopping times.

We consider a symmetric multi-players zero-sum game with two strategic variables. There are nn players, n3n\geq 3. Each player is denoted by ii. Two strategic variables are tit_i and sis_i, i{1,,n}i\in \{1, \dots, n\}. They are related by invertible functions. Using the minimax theorem by \cite{sion} we will show that Nas…

2018-06-17abs ↗pdf ↗

Randomized classifiers outperform deterministic ones in robustness against adversarial attacks.

problem Ensuring optimal robustness against all adversarial attacks.
method Game-theoretic approach, focusing on the non-existence of Nash equilibrium in deterministic classifiers and demonstrating the superiority of randomized classifiers.
result Randomized classifiers can outperform deterministic ones in robustness against adversarial attacks.

We consider a collection of prediction experiments, which are clustered in the sense that groups of experiments ex- hibit similar relationship between the predictor and response variables. The experiment clusters as well as the regres- sion relationships are unknown. The regression relation- ships define the experiment…

2011-03-23abs ↗pdf ↗

We develop robust Markov Decision Processes with risk measures for uncertain environments.

problem Uncertainty in Markov Decision Processes and its impact on risk measures.
method Formulation as a Stackelberg game, robust cost and value iterations, existence of optimal policies.
result Existence of deterministic optimal policies for robust optimization and risk measures.

We establish explicit socially optimal rules for an irreversible investment deci- sion with time-to-build and uncertainty. Assuming a price sensitive demand function with a random intercept, we provide comparative statics and economic interpreta- tions for three models of demand (arithmetic Brownian, geometric Brownian…

2014-05-31abs ↗pdf ↗

We consider the high-dimensional heteroscedastic regression model, where the mean and the log variance are modeled as a linear combination of input variables. Existing literature on high-dimensional linear regres- sion models has largely ignored non-constant error variances, even though they commonly occur in a variety…

2012-05-21abs ↗pdf ↗

We solve S-shaped utility portfolio selection with SD constraints using algorithms and neural networks.

problem Optimizing portfolios with S-shaped utility functions under SD constraints.
method First-order SD constraint solution, numerical algorithm for SSD, neural network approach.
result Effective numerical and neural network solutions for SSD constrained problems.

To solve key biomedical problems, experimentalists now routinely measure millions or billions of features (dimensions) per sample, with the hope that data science techniques will be able to build accurate data-driven inferences. Because sample sizes are typically orders of magnitude smaller than the dimensionality of t…

2017-09-05abs ↗pdf ↗

The paper proves three circles theorems and Liouville type theorems for subharmonic and holomorphic functions.

problem Establishing theorems for subharmonic and holomorphic functions on specific geometric structures.
method Using subharmonic and holomorphic functions on Riemannian manifolds and gradient shrinking Ricci solitons.
result Proves Liouville type theorems as applications of the established theorems.

Paper generalizes complex Brunn-Minkowski theory and proves new extension theorems.

problem Complex Brunn-Minkowski theory and extension theorems.
method Hilbert bundle approach to complex Brunn-Minkowski theory.
result Generalizes Guan's sharp strong openness theorem and sharp Ohsawa-Takegoshi extension theorem.

Formulates Index III lemma and Rauch III theorem with applications.

problem Develops new mathematical theorems based on existing ones.
method Formulation of Index III lemma and Rauch III theorem based on Index I, II lemmas and Rauch I, II theorems.
result Presented Rauch's type theorem and volume comparison result as applications.

In LM, we proved a family version of the famous Witten rigidity theorems and several family vanishing theorems for elliptic genera. In this paper, we gerenalize our theorems LM in two directions. First we establish a family rigidity theorem for the Dirac operator on loop space twisted by general positive energy loop gr…

1999-11-05abs ↗pdf ↗

The paper explains the topological origin of the distinction between incidence theorems over division rings and fields.

problem Understanding the distinction between incidence theorems over division rings and fields.
method Extending the surface-graph approach to noncommutative settings, the paper analyzes the topological properties of graphs embedded on surfaces of different genera.
result Theorems associated with graphs on the sphere hold over any division ring, while those on surfaces of positive genus typically hold only if the ground ring is a field.

INT benchmark tests theorem proving agents' ability to generalize to unseen theorems.

problem Evaluating theorem proving agents' ability to generalize to unseen theorems.
method INT benchmark based on a theorem generation and proof procedure with adjustable knobs for measuring 6 types of generalization.
result MCTS can help agents prove new theorems.

A homological selection theorem for C-spaces, as well as, a finite-dimensional homological selection theorem is established. We apply the finite-dimensional homological selection theorem to obtain fixed-point theorems for usco homologically UV^n set-valued maps.

2016-05-11abs ↗pdf ↗

The paper proves injectivity and vanishing theorems on compact Kahler manifolds.

problem Injectivity and vanishing theorems on compact Kahler manifolds.
method Hodge theory, Bochner-Kodaira-Nakano identity, analytic method, transcendental method, Demailly-Peternell-Schneider equisingular approximation theorem, Hormander L2 estimates.
result The main injectivity theorem implies several Nadel type vanishing theorems.

The study establishes comparison theorems for weighted Finsler manifolds and spacetimes.

problem Analyzing weighted Finsler manifolds and spacetimes with curvature conditions.
method Using weight function and εε-range, the Bonnet-Myers theorem, Laplacian comparison theorem, and Bishop-Gromov volume comparison theorem are formulated.
result New comparison theorems for weighted Finsler manifolds and spacetimes are derived, including those for weighted Riemannian manifolds.