Paper proposes government indemnification for AI risks to solve judgment-proof problem.
problem Uninsurable risks from AI, especially existential risks, create a judgment-proof problem.
method A government-provided, mandatory indemnification program using risk-priced fees and Bayesian Truth Serum.
result The approach better leverages private information and signals risk mitigation efforts.
We survey the status of some decision problems for 3-manifolds and their fundamental groups. This includes the classical decision problems for finitely presented groups (Word Problem, Conjugacy Problem, Isomorphism Problem), and also the Homeomorphism Problem for 3-manifolds and the Membership Problem for 3-manifold gr…
Optimal transport reformulates multiple quantile hedging problem.
problem Multiple quantile hedging problem in incomplete markets.
method Reformulated as Monge optimal transport problem, introduced Kantorovitch version, proved no duality gap.
result Multiple quantile hedging problem can be seen as semi-discrete optimal transport problem.
Solves four problems related to circle families in the plane.
problem Four basic problems of circle families in the plane.
method Solves all four basic problems of circle families in the plane.
result All four basic problems are solved.
Solves four problems related to sphere families in 3D space.
problem Four basic problems of sphere families in Euclidean 3-space.
method Solves all four basic problems of sphere families in Euclidean 3-space.
result All four basic problems are solved.
The paper solves optimal control problems for various convex sets using convex trigonometry.
problem Optimal control problems with 2D convex compact sets.
method Using convex trigonometry to derive extremals for various problems.
result Geodesics in multiple sub-Finsler problems are derived.
This paper is a tutorial for eigenvalue and generalized eigenvalue problems. We first introduce eigenvalue problem, eigen-decomposition (spectral decomposition), and generalized eigenvalue problem. Then, we mention the optimization problems which yield to the eigenvalue and generalized eigenvalue problems. We also prov…
This paper solves the Christoffel problem in hyperbolic space and its equivalent on spheres.
problem Prescribing curvatures for convex hypersurfaces in hyperbolic space.
method Proving a full rank theorem to establish the existence of solutions.
result Existence of solutions to the Christoffel problem and its equivalent Nirenberg-Kazdan-Warner problem on spheres.
In the present paper, the primal-dual problem consisting of the investment risk minimization problem and the expected return maximization problem in the mean-variance model is discussed using replica analysis. As a natural extension of the investment risk minimization problem under only a budget constraint that we anal…
Study proves only origin-centered spheres solve certain curvature problems.
problem Proving uniqueness of solutions to curvature problems.
method Using the Heintze-Karcher inequality, the study proves the uniqueness of smooth, strictly convex solutions to a class of Minkowski type problems.
result Only origin-centered spheres solve isotropic and Lp-Gaussian-Minkowski problems. MathChat uses LLM agents to solve challenging math problems through conversational problem-solving.
problem Solving math problems expressed in natural language.
method MathChat is a conversational framework combining an LLM agent and a user proxy agent for collaborative problem-solving.
result MathChat improves tool-using prompting methods by 6% on difficult math problems.
The paper solves a generalized Christoffel-Minkowski problem using a curvature flow.
problem Solving the (p,q)-Christoffel-Minkowski problem.
method Investigating the problem via an expanding curvature flow.
result Existence and uniqueness of smooth solutions to the (p,q)-Christoffel-Minkowski problem.
Paper solves Gromov-Wasserstein for point clouds efficiently.
problem Quantifying similarity between two formations or shapes.
method Reformulates QAP as low-rank concave quadratic optimization problem.
result Global solution for large-scale problems with thousands of points.
The paper explains how microlocal analysis solves geometric inverse problems.
problem Recovering geometric information from boundary measurements.
method Microlocal analysis applied to three inverse problems.
result Microlocal techniques solve specific inverse problems in Riemannian geometry.
Proves NP and co-NP status for knot core recognition in solid torus.
problem Determining if a knot is the core of a solid torus.
method Alternate proof and corollary of Hopf link recognition problem.
result Proves NP and co-NP status for solid torus core recognition problem.
The min-max problem, also known as the saddle point problem, is a class of optimization problems which minimizes and maximizes two subsets of variables simultaneously. This class of problems can be used to formulate a wide range of signal processing and communication (SPCOM) problems. Despite its popularity, most exist…
A new method solves complex control problems with random coefficients.
problem Solving LQ McKean-Vlasov control problems with random coefficients.
method Decomposes the problem into two decoupled stochastic optimal control problems.
result The sum of optimal controls of auxiliary problems equals the original problem's optimal control.
This is a survey of some problems in geometric group theory which I find interesting. The problems are from different areas of group theory. Each section is devoted to problems in one area. It contains an introduction where I give some necessary definitions and motivations, problems and some discussions of them. For ea…
We present updates to the problems on Hirzebruch's 1954 problem list focussing on open problems, and on those where substantial progress has been made in recent years. We discuss some purely topological problems, as well as geometric problems about (almost) complex structures, both algebraic and non-algebraic, about co…
New method solves generalized Minkowski problem for torsional rigidity.
problem Generalized Minkowski problem for torsional rigidity.
method Flow method
result Existence of solutions for general measures.
We present 27 problems encountered in automating the translation of movie/TV show subtitles. We categorize each problem in one of the three categories viz. problems directly related to textual translation, problems related to subtitle creation guidelines, and problems due to adaptability of machine translation (MT) eng…
Solves Brezis' first open problem on ball solutions.
problem Existence of solutions to Brezis-Nirenberg problem on a 3D ball.
method Building on sign-changing solutions to the Yamabe problem.
result Infinitely many sign-changing, nonradial solutions found.
Classical knot recognition problem solved in NP with exponential time algorithm.
problem Determining if a virtual knot is classical.
method Proved NP membership and provided an exponential time algorithm.
result Classical knot recognition problem is in NP.
Ranking problems, also known as preference learning problems, define a widely spread class of statistical learning problems with many applications, including fraud detection, document ranking, medicine, credit risk screening, image ranking or media memorability. In this article, we systematically review different types…
Paper solves four problems of pseudo-circle envelopes in Minkowski plane.
problem Four problems of pseudo-circle envelopes in Minkowski plane.
method Solutions to four basic problems.
result Solved four problems of pseudo-circle envelopes in Minkowski plane.
In this paper, we address the inverse problem, or the statistical machine learning problem, in Markov random fields with a non-parametric pair-wise energy function with continuous variables. The inverse problem is formulated by maximum likelihood estimation. The exact treatment of maximum likelihood estimation is intra…
Conference compiles problems on foliations and diffeomorphisms.
problem Challenges in foliations and diffeomorphism groups.
method Compilation of problems from conference participants.
result Compilation of 20+ problems on foliations and diffeomorphisms.
Solves double coset problem for braid group H_n.
problem Double coset problem in braid group B_n modulo H_n.
method Uses Garside's decomposition of braids in B_n.
result Demonstrates stable equivalence of Link Problem to solvable algebraic problem.
In this paper, we discuss the uniqueness in an integral geometry problem in a strongly convex domain. Our problem is related to the problem of finding a Riemannian metric by the distances between all pairs of the boundary points. For the proof, the problem is reduced to an inverse source problem for a kinetic equation …
This paper solves the dual Minkowski problem for q-torsional rigidity.
problem The dual Minkowski problem for q-torsional rigidity.
method Introduced the p-th dual q-torsional measure and solved the p-th dual Minkowski problem for q-torsional rigidity using a Gauss curvature flow.
result Existence of smooth even and non-even solutions to the p-th dual Minkowski problem for q-torsional rigidity.
Study on geometric variational problems for existence, regularity, and uniqueness of solutions.
problem Geometric variational problems, focusing on existence, regularity, and uniqueness of solutions.
method Formulated in Federer and Fleming's theory of currents, discussed the existence theory, and presented core ideas of the (interior) regularity theory for area-minimizing currents and optimal transport paths. Two original results on generic uniqueness of solutions were presented.
result Generic uniqueness of solutions for both Plateau's problem and optimal branched transport problem.
Solves a discrete logarithmic Minkowski problem for electrostatic p-capacity.
problem Characterize measures generated by electrostatic p-capacity.
method Solves the discrete logarithmic Minkowski problem for 1 < p < n.
result Solves the discrete logarithmic Minkowski problem for measures in general position.
Study on biharmonic Steklov problems with Neumann boundary conditions and eigenvalue estimates.
problem Biharmonic Steklov problems with Neumann boundary conditions.
method Introduced a biharmonic Steklov problem and proved its well-posedness. Established eigenvalue estimates using Kuttler-Sigillito inequalities.
result Eigenvalue estimates for the biharmonic Steklov problem with Neumann boundary conditions.
Machine learning reduces combinatorial optimization problem dimensions.
problem Reducing the complexity of large combinatorial optimization problems.
method Generalization of a machine learning model for problem reduction on TSP.
result Machine learning can predict which variables are not part of an optimal solution.
New reformulations for multiclass classification problems using optimal transport.
problem Adversarial multiclass classification problems.
method Multimarginal optimal transport formulation.
result Reveals geometric structure and extends binary classification results.
Study anisotropic flows solving Orlicz-Minkowski problems, proving existence and new results.
problem Anisotropic non-homogeneous Gauss curvature flows and Orlicz-Minkowski problems.
method Long-time existence and behavior analysis, parabolic approximation method, curvature flow.
result Existence and new results for Orlicz-Minkowski problems, including Lp versions. In this paper we consider stochastic optimization problems for an ambiguity averse decision maker who is uncertain about the parameters of the underlying process. In a first part we consider problems of optimal stopping under drift ambiguity for one-dimensional diffusion processes. Analogously to the case of ordinary o…
MCGDiff uses SGM to guide SMC for solving ill-posed linear inverse problems.
problem Solving ill-posed linear inverse problems in Bayesian settings.
method Exploiting SGM structure, defining a sequence of intermediate problems, and using SMC methods.
result MCGDiff outperforms competing methods in Bayesian ill-posed inverse problems.
Paper proves smoothness of solutions to a complex geometric problem.
problem Smoothness of solutions to the degenerate Lp Dual Minkowski problem. method Inspired by Guan and Li's approach for the Aleksandrov problem, the authors derive C1,1 estimates. result Proves solutions are C1,1 regular. Paper solves a control problem with robust methods.
problem Monotone mean-variance problems with stochastic coefficients.
method Finding saddle point through BSDEs with unbounded coefficients.
result Optimal control and value match mean-variance problems.
New algorithm solves complex optimization problems efficiently.
problem Minimizing convex upper-level functions over optimal lower-level solutions.
method Reformulates bilevel problems into functionally constrained problems, achieving near-optimal rates.
result Achieves near-optimal rates for both smooth and nonsmooth problems.
Paper solves Minkowski problem for anisotropic p-torsional rigidity.
problem Solving the Minkowski problem for anisotropic p-torsional rigidity.
method Using the anisotropic p-Laplacian equation, presenting sufficient and necessary conditions for existence. result Presented sufficient and necessary conditions for the existence of a solution.
Paper solves Christoffel-Minkowski and Weingarten curvature problems in hyperbolic space.
problem Christoffel-Minkowski and Weingarten curvature problems in hyperbolic space.
method Proved existence of solutions using a new full rank theorem.
result Existence of smooth, origin-symmetric, strictly horospherically convex solutions.
State variables are easily the most subtle dimension of sequential decision problems. This is especially true in the context of active learning problems (bandit problems") where decisions affect what we observe and learn. We describe our canonical framework that models {\it any} sequential decision problem, and present…
Unified SGD method improves convergence for nested optimization problems.
problem Stochastic nested optimization problems.
method ALTERNATE dESCEN (ALSET) method leveraging hidden smoothness.
result Requires O(ε−2) samples to achieve an ε-stationary point. New algorithm solves complex stopping problems with robust optimization.
problem Solving complex stochastic optimal stopping problems.
method Simulation-based robust optimization with exact reformulation as a zero-one bilinear program.
result Developed polynomial-time heuristics and algorithms for practical solution.
We prove that fundamental groups of non-orientable 3-manifolds have a solvable conjugacy problem, and construct an algorithm. Together with our earlier work on the conjugacy problem in groups on orientable geometrizable 3-manifolds, all π1 of (geometrizable) 3-manifolds have a solvable conjugacy problem. In corollar…
Paper solves Christoffel-Minkowski problem in hyperbolic space.
problem Prescribing k-th horospherical p-surface area measure of h-convex domains in hyperbolic space. method Considered a fully nonlinear equation and used the full rank theorem with a viscosity approach.
result Existence of uniformly h-convex solution under appropriate assumptions.