Minimal surfaces help prove a conjecture about special metrics.
problem Proving Arthur L. Besse's conjecture about CPE metrics.
method Using the theory of minimal surfaces.
result The conjecture is proven for 3D manifolds.
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
48 results for “CPE conjecture”
Paper studies a new curvature system and proves rigidity and gap theorems.
problem Extending CPE conjecture to manifolds with specific structures.
method Introduces system and proves rigidity and gap theorems.
result Proves rigidity and gap theorems for solutions.
The paper characterizes Einstein metrics using CPE metrics and vacuum static spaces.
problem Understanding the conditions for Einstein metrics using CPE metrics and vacuum static spaces.
method Analyzing CPE metrics and their relationship with Einstein metrics and vacuum static spaces.
result A necessary and sufficient condition for a CPE metric to be Einstein in terms of σ_2-singular spaces is provided.
The purpose of this paper is to investigate the critical points of the total scalar curvature functional restricted to space of metrics with constant scalar curvature of unitary volume, for simplicity CPE metrics. It was conjectured in 's that every CPE metric must be Einstein. We prove that a -dimensional CPE…
In this paper, we consider the CPE conjecture in the frame-work of -contact and -contact manifolds. First, we prove that if a complete -contact metric satisfies the CPE is Einstein and is isometric to a unit sphere . Next, we prove that if a non-Sasakian -contact metric satisfies the C…
New research shows CPE only occurs when Bayesian posterior underfits.
problem Model misspecification leading to CPE under perfect model specification.
method Theoretical analysis of Bayesian posterior and underfitting.
result No CPE if there is no underfitting of the Bayesian posterior.
A new method ReCPE removes the need for a distributional assumption in PU learning.
problem Training binary classifiers with only positive and unlabeled data without negative data.
method Regrouping CPE (ReCPE) that constructs an auxiliary distribution to ensure positive data support is never in negative data support.
result ReCPE improves all state-of-the-art CPE methods on various datasets, indicating the need for the distributional assumption.
The Besse's conjecture was posted on the well-known book Einstein manifolds by Arthur L. Besse, which describes the critical point of Hilbert-Einstein functional with constraint of unit volume and constant scalar curvature. In this article, we show that there is an interesting connection between Besse's conjecture and …
In this paper, we have studied the critical point equation (shortly, CPE) within the frame-work of Kenmotsu and almost Kenmotsu manifold satisfying certain nullity conditions. First, we prove that a complete Kenmotsu metric satisfies the CPE is Einstein and locally isometric to the hyperbolic space H2n+1. In case of Ke…
The paper tackles combinatorial pure exploration with various feedback structures and proposes efficient algorithms.
problem Identifying the optimal action in a combinatorial space with limited feedback and nonlinear rewards.
method Designs polynomial-time adaptive algorithms for CPE-BL and CPE-PL, providing sample complexity analyses.
result The proposed algorithms achieve sample complexity close to lower bounds and outperform existing methods.
This paper tackles combinatorial pure exploration for dueling bandits, aiming to find the best candidate-position match.
problem Finding the best candidate-position match in a dueling bandit setting.
method The paper adapts combinatorial pure exploration for multi-armed bandits to dueling bandits, considering both Borda winner and Condorcet winner cases. It designs PAC and exact algorithms for Borda winner and a fully polynomial time approximation scheme (FPTAS) for Condorcet winner.
result The paper introduces the first algorithm with polynomial running time per round for identifying the Condorcet winner in CPE-DB.
The paper proves conjectures and classifies metrics on 3D manifolds.
problem Proving conjectures and classifying metrics on 3D manifolds with specific curvature conditions.
method Analytical proofs and classification theorems.
result Critical metrics on 3D manifolds are isometric to geodesic balls in space forms.
Improves reliability of medical diagnosis uncertainty estimates.
problem Label uncertainty in medical diagnosis.
method Post-hoc -calibration method for neural network classifiers.
result Significantly enhances reliability of uncertainty estimates.
Causal Posterior Estimation improves Bayesian inference in complex models.
problem Bayesian inference in models with intractable likelihood functions.
method Normalizing flow-based approximation with conditional dependence structure.
result Improved accuracy in posterior inference through direct incorporation of model structure.
We study the problem of stochastic combinatorial pure exploration (CPE), where an agent sequentially pulls a set of single arms (a.k.a. a super arm) and tries to find the best super arm. Among a variety of problem settings of the CPE, we focus on the full-bandit setting, where we cannot observe the reward of each singl…
New algorithm identifies optimal actions in large reward spaces efficiently.
problem Finding the best action from a large set of options with minimal trials.
method GenTS-Explore algorithm for real-valued combinatorial pure exploration.
result Achieves optimal sample complexity for large action sets.
Let be the space of smooth metrics on a given compact manifold () with constant scalar curvature and unitary volume. The goal of this paper is to study the critical point of the total scalar curvature functional restricted to the space (we shall refer to this critical poi…
We study the Combinatorial Pure Exploration problem with Continuous and Separable reward functions (CPE-CS) in the stochastic multi-armed bandit setting. In a CPE-CS instance, we are given several stochastic arms with unknown distributions, as well as a collection of possible decisions. Each decision has a reward accor…
Improved GAN training stability through tunable classification losses.
problem Training instabilities in GANs.
method Reformulated GAN value function using class probability estimation (CPE) losses, defined -GANs.
result Tuning can alleviate training instabilities.
A new method selects optimal temperature for Bayesian Deep Learning.
problem Finding the optimal temperature for improving predictive performance in Bayesian Deep Learning.
method Data-driven approach to estimate temperature as a model parameter.
result Our method performs comparably to grid search but at a fraction of the cost.
This paper tackles combinatorial optimization under uncertainty with limited feedback.
problem Tackling combinatorial optimization problems with uncertain or unknown parameters.
method Review of techniques for combinatorial pure exploration with limited bandit feedback.
result Introduction of methods for combinatorial optimization under uncertainty with limited observation.
A-GPS learns to generate Pareto sets efficiently with user preferences.
problem Online discrete multi-objective optimization with user preferences.
method Generative model with class probability estimator (CPE) for non-dominance and preference alignment.
result Amortized generative model for efficient Pareto set approximation.
New algorithm finds high-reward combinatorial sets with fewest pulls.
problem Finding high-reward combinatorial sets with unknown individual arm rewards.
method Successive acceptance and elimination based on combinatorial structure.
result Algorithm requires minimal combinatorial oracle calls, making it practical for large problems.
A study on -GANs proving convergence and estimation guarantees.
problem Analyzing the convergence and estimation guarantees of -GANs.
method Proved a correspondence between -GANs and -divergences, and provided estimation bounds.
result Estimation bounds indicate diverse GAN behavior as a function of .
Given a huge set of applicants, how should a firm allocate sequential resume screenings, phone interviews, and in-person site visits? In a tiered interview process, later stages (e.g., in-person visits) are more informative, but also more expensive than earlier stages (e.g., resume screenings). Using accepted hiring mo…
Study post-hoc Learning to Defer using density-ratio losses.
problem Optimizing decision-making between models and experts.
method Density-ratio losses for post-hoc L2D scorers, derived from class-probability estimation.
result The approach recovers known results and introduces new connections to expert comparison and anomaly detection.
Polyhedra volume conjecture supports Stoker conjecture weakly.
problem Proving the Stoker conjecture for polyhedra.
method Using an extension of Montcouquiol and Weiss' result on polyhedra angles as local coordinates.
result Volume Conjecture for polyhedra implies a weak version of the Stoker conjecture.
Survey on two non-Kähler geometry conjectures.
problem Constant holomorphic sectional curvature and Fino-Vezzoni conjectures in non-Kähler geometry.
method Survey and discussion of historical and recent developments.
result Discussion of conjectures without new results.
Numerical study confirms Brennan's conjecture for a counterexample to Thurston's conjecture.
problem Thurston's conjecture and Brennan's conjecture in planar domains.
method Numerical analysis of a specific counterexample to Thurston's conjecture.
result The counterexample does not contradict Brennan's conjecture.
The non-vanishing conjecture implies the abundance conjecture in certain cases.
problem Abundance conjecture in algebraic geometry.
method Proof of the abundance conjecture under specific conditions.
result The abundance conjecture holds in dimensions ≤ 5 when κ ≥ 0 and ν ≤ 1.
Proves Gromov's conjecture and answers Stoker's polyhedron conjecture.
problem Gromov's flat corner domination conjecture and Stoker's conjecture for convex polyhedra.
method Same techniques applied to prove conjectures.
result Proves Gromov's conjecture and answers Stoker's polyhedron conjecture.
This paper gives an algebraic conjecture which is shown to be equivalent to Thurston's Geometrization Conjecture for closed, orientable 3-manifolds. It generalizes the Stallings-Jaco theorem which established a similar result for the Poincare Conjecture. The paper also gives two other algebraic conjectures; one is equi…
Symmetry-breaking in three differential geometry conjectures.
problem Exploring the role of symmetry in three differential geometry conjectures.
method Examining the Carathéodory, Willmore, and Lawson Conjectures through the lens of symmetry in 3D space-forms.
result Symmetry is broken, and more general ambient metrics are considered, leading to the failure of the conjectures.
We introduce a new variant of the coarse Baum-Connes conjecture designed to tackle coarsely disconnected metric spaces called the boundary coarse Baum-Connes conjecture. We prove this conjecture for many coarsely disconnected spaces that are known to be counterexamples to the coarse Baum-Connes conjecture. In particula…
Study proves Hecke lifting conjecture for torus knots and verifies it for any framed knots.
problem Integrality structure of framed knots' quantum invariants.
method Explicit formulas of colored HOMFLY-PT invariants of torus knots, verified in a limit form for any framed knots.
result Proves Hecke lifting conjecture for torus knots and verifies it for any framed knots.
New proof shows most thin knots satisfy Cabling Conjecture.
problem Cabling Conjecture for thin knots using Heegaard Floer homology.
method Heegaard Floer homology and immersed curves techniques.
result Almost all thin knots satisfy the Cabling Conjecture.
We review the Burghelea conjecture, which constitutes a full computation of the periodic cyclic homology of complex group rings, and its relation to the algebraic Baum-Connes conjecture. The Burghelea conjecture implies the Bass conjecture. We state two conjectures about groups of finite asymptotic dimension, which tog…
Metric SYZ conjecture proved using non-archimedean geometry.
problem Proving the metric SYZ conjecture in large generality.
method Using non-archimedean geometry to support the conjecture.
result Metric SYZ conjecture can be proved in large generality.
Paper confirms Chen's biharmonic conjecture for hypersurfaces in 5D.
problem Chen's conjecture on biharmonic submanifolds in Euclidean spaces.
method Analyzes hypersurfaces in \(\mathbb{R}^5\) for \(n=4\).
result Chen's conjecture is confirmed for hypersurfaces in \(\mathbb{R}^5\) when \(n=4\).
Counterexample disproves recent Penrose conjecture variant.
problem A variant of the Penrose conjecture.
method Provided a counterexample.
result The conjectured variant of the Penrose inequality is false.
Proofs On Arnold Conjecturesmath.SG
In this article, we give proofs on the Arnold Lagrangian intersection conjecture on the cotangent bundles, Arnold-Givental Lagrangian intersection conjecture and the Arnold fixed point conjecture.
Proof outlined for 4D smooth Poincaré conjecture.
problem 4-dimensional smooth Poincaré conjecture.
method Outline of proof.
result Proof of 4D smooth Poincaré conjecture.
In order to give a unified generalization of the BW inequality and the DDVV inequality, Lu and Wenzel proposed three Conjectures 1, 2, 3 and an open Question 1 in 2016. In this paper we discuss further these conjectures and put forward several new conjectures which will be shown equivalent to Conjecture 2. In particula…
In this paper, we generalize the Cosmetic Surgery Conjecture to an -cusped hyperbolic -manifold and prove it under the assumption of another well-known conjecture in number theory, so called the Zilber-Pink Conjecture. For and , we show them without the assumption.
Paper connects AJ conjecture and colored Jones polynomial potential function.
problem Relationship between -polynomial and colored Jones polynomial.
method Connects AJ conjecture and colored Jones polynomial potential function.
result Establishes connection between -polynomial and colored Jones polynomial potential function.
Akbulut and Kirby conjectured that two knots with the same -surgery are concordant. In this paper, we prove that if the slice-ribbon conjecture is true, then the modified Akbulut-Kirby's conjecture is false. We also give a fibered potential counterexample to the slice-ribbon conjecture.
Counterexample disproves conjectures about log canonical thresholds.
problem Conjectures about log canonical thresholds were disproved.
method Provided a counterexample to both conjectures.
result Conjectures about log canonical thresholds are false.
Study confirms conjecture on Hermitian manifolds with bounded mass.
problem Morse-type integrals in nef (1,1) classes on compact Hermitian manifolds with bounded mass.
method Analyzes conjecture using bounded mass property on compact Hermitian manifolds.
result Confirms Demailly-Păun and Tosatti-Weinkove's conjectures.