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

4028041,2061,608 · Jun 202019922001200920172026
48 results for Maximal initial data sets

Proposes a method to optimize neural network initialization using marginal likelihood maximization.

problem Optimizing hyperparameters for neural network initialization.
method Leverages the connection between neural networks and Gaussian processes to infer optimal hyperparameters.
result Marginal likelihood maximization provides near-optimal prediction performance on MNIST classification tasks.

We establish an optimal gluing construction for general relativistic initial data sets. The construction is optimal in two distinct ways. First, it applies to generic initial data sets and the required (generically satisfied) hypotheses are geometrically and physically natural. Secondly, the construction is completely …

2004-09-10abs ↗pdf ↗

We present a local gluing construction for general relativistic initial data sets. The method applies to generic initial data, in a sense which is made precise. In particular the trace of the extrinsic curvature is not assumed to be constant near the gluing points, which was the case for previous such constructions. No…

2004-03-15abs ↗pdf ↗

Study constructs solutions for evolving hypersurfaces using inverse spacetime mean curvature.

problem Evolution of hypersurfaces in spacetime.
method Weak solutions for hypersurfaces evolving along inverse spacetime mean curvature in asymptotically flat maximal initial data sets.
result Weak solution detects both future- and past-trapped apparent horizons.

This article, written to appear as a chapter in "The Springer Handbook of Spacetime", is a review of the initial value problem for Einstein's gravitational field theory in general relativity. Designed to be accessible to graduate students who have taken a first course in general relativity, the article first discusses …

2013-04-07abs ↗pdf ↗

In this paper, we firstly give a brief introduction of expectation maximization (EM) algorithm, and then discuss the initial value sensitivity of expectation maximization algorithm. Subsequently, we give a short proof of EM's convergence. Then, we implement experiments with the expectation maximization algorithm (We im…

2013-05-03abs ↗pdf ↗

Study proves inequality linking black hole properties and angular momentum.

problem Establishing a Penrose-type inequality for black holes with 3-sphere horizons.
method Analyzing biaxially symmetric, maximal, asymptotically flat initial data sets for the Einstein equations.
result Equality holds only for stationary Myers-Perry black holes.

Proves stability of Minkowski space for specific initial data.

problem Stability of Minkowski space under spacelike-characteristic initial data.
method Vectorfield method and bootstrapping argument, with new geometric constructions.
result Global nonlinear stability of Minkowski space proved for the spacelike-characteristic Cauchy problem.

New method improves BO's AF maximizer initialization for high-dimensional problems.

problem Challenges in maximizing acquisition functions in high-dimensional Bayesian optimization.
method Proposes a heuristic optimizer-based initialization approach to improve AF maximizer performance.
result Our approach significantly enhances BO performance in most test cases.

New method for fair influence maximization in social networks.

problem Maximizing influence while ensuring fairness across sensitive attributes.
method Co-training an auto-encoder and discriminator to create fair graph embeddings.
result Our method reduces disparity while maintaining competitive influence maximization performance.

Paper refutes EM convergence theory and introduces a new EM algorithm.

problem The convergence theory of the EM algorithm is incorrect and affects its performance.
method Proposes a new EM algorithm called the Channel Matching (CM) EM algorithm and provides an initialization map.
result The locally maximal Q can affect the convergent speed but not the global convergence.

Constructs initial data for multiple black holes with specified ADM parameters.

problem Forming multiple black holes with specific ADM parameters.
method Smooth, asymptotically flat vacuum initial data with prescribed ADM energy, momentum, and angular momentum.
result Maximal development of data results in spacetimes containing multiple black holes.

We consider the problem of \emph{influence maximization}, the problem of maximizing the number of people that become aware of a product by finding the `best' set of `seed' users to expose the product to. Most prior work on this topic assumes that we know the probability of each user influencing each other user, or we h…

2015-02-27abs ↗pdf ↗

Study shows MDA's effectiveness even when more components are assumed than in actual data.

problem Classification error in overspecified Mixture Discriminant Analysis.
method Two-component Gaussian mixture model, EM algorithm, theoretical analysis of convergence and error rates.
result EM algorithm converges exponentially fast to Bayes risk with suitable initialization.

Localized big bang singularities found without background solutions.

problem Proving localized big bang formation without proximity to background solutions.
method Introducing a new foliation by spacelike hypersurfaces and a time function to synchronize and stabilize the singularity.
result Maximally globally hyperbolic developments have local quiescent big bang singularities with curvature blow-up.

Maximal initial learning rate for deep ReLU networks identified.

problem Finding the optimal initial learning rate for deep neural networks.
method Simple approach to estimate maximal initial learning rate ηη^{\ast}, analyzing its behavior in constant-width fully-connected ReLU networks.
result Maximal initial learning rate ηη^{\ast} is well predicted as a power of depth × width, with specific conditions for network width and input layer training.

Solves initial boundary value problem for vacuum Einstein equations and proves geometric uniqueness.

problem Initial boundary value problem for vacuum Einstein equations.
method Formulated IBVP, solved simultaneously in local harmonic coordinates, constructed unique maximal globally hyperbolic solution.
result Vacuum spacetimes satisfying fixed initial-boundary conditions and corner conditions are geometrically unique near the initial surface.

Paper proves rigidity of initial data sets with boundary and capillary MOTS.

problem Rigidity of initial data sets with boundary and capillary MOTS.
method Estimates area of MOTS, proves rigidity for 3D, extends to high dimensions using Yamabe constant.
result Rigidity results for initial data sets with boundary and capillary MOTS.

Paper proposes efficient and accurate initialization and EM algorithm for PL mixture models.

problem Initialization issues and combinatorial complexity in PL likelihood maximization.
method Initialization algorithm and EM algorithm for true log-likelihood maximization.
result Proposed algorithm provides accurate initial estimates and efficiently maximizes true log-likelihood.

This work takes up the challenges of utility maximization problem when the market is indivisible and the transaction costs are included. First there is a so-called solvency region given by the minimum margin requirement in the problem formulation. Then the associated utility maximization is formulated as an optimal swi…

2010-03-15abs ↗pdf ↗

Constructs constant spacetime mean curvature surfaces for hyperboloidal initial data sets.

problem Creating a foliation of constant spacetime mean curvature surfaces for asymptotically hyperboloidal initial data sets.
method Long time limit of volume preserving spacetime mean curvature flow starting from a constant mean curvature foliation.
result Obtains a foliation of constant spacetime mean curvature surfaces as the long time limit.