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.

169,341 papers · 148 categories

Trend · papers per month

112225337449 · Jun 202019922001200920182026
48 results for MU graph prior

The problem is sequence prediction in the following setting. A sequence x1,..., xn,... of discrete-valued observations is generated according to some unknown probabilistic law (measure) mu. After observing each outcome, it is required to give the conditional probabilities of the next observation. The measure mu belongs…

2014-08-09abs ↗pdf ↗

We study the problem of finding a minimal graph with prescribed boundary data in arbitrary dimension and codimension. Existence, uniqueness, stability and regularity are treated. We first present the well-known results for codimension one: Jenkins-Serrin's existence theorem, convexity properties of the area which give …

2004-11-26abs ↗pdf ↗

The main aim of this paper is the construction of a smooth (sometimes called differential) extension \hat{MU} of the cohomology theory complex cobordism MU, using cycles for \hat{MU}(M) which are essentially proper maps W\to M with a fixed U(n)-structure and U(n)-connection on the (stable) normal bundle of W\to M. Cruc…

2007-11-07abs ↗pdf ↗

Two welded (respectively virtual) link diagrams are homotopic if one may be transformed into the other by a sequence of extended Reidemeister moves, classical Reidemeister moves, and self crossing changes. In this paper, we extend Milnor's mu and bar mu invariants to welded and virtual links. We conclude this paper wit…

2006-11-03abs ↗pdf ↗

Study on constant mu-scalar curvature Kähler metrics, generalizing cscK and Kähler-Ricci solitons.

problem Existence and uniqueness of constant mu-scalar curvature Kähler metrics.
method Investigation of volume functional and study of a new K-energy.
result Fundamental constraints and existence conditions for constant mu-scalar curvature Kähler metrics.

Given a suitable link map f into a manifold M, we constructed, in [10], link homotopy invariants kappa(f) and mu(f). In the present paper we study the case M=S^n x R^{m - n} in detail. Here mu(f) turns out to be the starting term of a whole sequence mu^(s)(f), s = 0, 1, ..., of higher mu-invariants which together captu…

2006-06-01abs ↗pdf ↗

We show that for rational surface singularities with odd determinant the mu-bar invariant defined by W. Neumann is an obstruction for the link of the singularity to bound a rational homology 4-ball. We identify the mu-bar invariant with the corresponding correction term in Heegaard Floer theory.

2007-11-12abs ↗pdf ↗

The theory of link-homotopy, introduced by Milnor, is an important part of the knot theory, with Milnor's mu-bar-invariants being the basic set of link-homotopy invariants. Skein relations for knot and link invariants played a crucial role in the recent developments of knot theory. However, while skein relations for Al…

2005-07-29abs ↗pdf ↗

ε-Consistent Mixup improves semi-supervised classification accuracy.

problem Improving semi-supervised classification accuracy with limited labeled data.
method Combines Mixup's linear interpolation with consistency regularization, using an adaptive tradeoff between the two.
result ε-Consistent Mixup yields the largest gains in low label-availability scenarios.

Paper proposes a statistical model for detecting mu-suppression in EEG signals.

problem Detecting mu-suppression in motor imagery EEG signals.
method Proposes a statistical model based on the generalized extreme value distribution (GEV) and a linear classifier.
result Preliminary results show good classification accuracy in detecting mu-suppression and distinguishing EEG events.

Given an arbitrary d>0 we construct a group G and a group ring element S in Z[G] such that the spectral measure mu of S has the property that mu((0,eps)) > C/|log(eps)|^(1+d) for small eps. In particular the Novikov-Shubin invariant of any such S is 0. The constructed examples show that the best known upper bounds on m…

2014-09-10abs ↗pdf ↗

This paper tackles task offloading in edge computing systems with dynamic interactions.

problem Dynamic interactions among mobile users in an edge computing system.
method Modelled as a non-cooperative stochastic game, transformed into a Markov decision process, and solved using online deep reinforcement learning.
result The proposed deep RL scheme balances age of information and energy consumption.

This paper characterizes mu-cscK metrics using Perelman's W-entropy.

problem Characterizing mu-cscK metrics and understanding their properties.
method Using Perelman's W-entropy as a functional on the tangent bundle of Kähler metrics, the paper characterizes mu-cscK metrics as critical points of this functional.
result The W-entropy is monotonic along geodesics and provides a lower bound for mu-entropy.

Unified proof for MU algorithm convergence in NMF with various divergences and regularizers.

problem Theoretical convergence guarantees for MU algorithm in NMF with diverse conditions.
method Unified proof strategy for MU algorithm convergence in NMF with various divergences and regularizers.
result Sequence of iterates converges to the set of stationary points of non-convex NMF optimization problem.

`Distribution regression' refers to the situation where a response Y depends on a covariate P where P is a probability distribution. The model is Y=f(P) + mu where f is an unknown regression function and mu is a random error. Typically, we do not observe P directly, but rather, we observe a sample from P. In this paper…

2013-02-01abs ↗pdf ↗

We extend Milnor's mu-invariants of link homotopy to ordered (classical or virtual) tangles. Simple combinatorial formulas for mu-invariants are given in terms of counting trees in Gauss diagrams. Invariance under Reidemeister moves corresponds to axioms of Loday's diassociative algebra. The relation of tangles to dias…

2010-10-31abs ↗pdf ↗

A systematic algorithm for building integrating factors of the form mu(x,y') or mu(y,y') for non-linear second order ODEs is presented. When such an integrating factor exists, the algorithm determines it without solving any differential equations. Examples of ODEs not having point symmetries are shown to be solvable us…

1997-11-27abs ↗pdf ↗

The Dirac operator d+delta on the Hodge complex of a Riemannian manifold is regarded as an annihilation operator A. On a weighted space L_mu^2 Omega, [A,A*] acts as multiplication by a positive constant on excited states if and only if the logarithm of the measure density of mu satisfies a pair of equations. The equati…

2001-04-17abs ↗pdf ↗

The paper introduces MU for NMF with ββ-divergences and disjoint constraints.

problem Nonnegative matrix factorization with constraints.
method Design multiplicative updates for NMF based on ββ-divergences with disjoint constraints.
result Multiplicative updates satisfy constraints and decrease the objective function.

Detects graph topology changes from noisy signals using prior spectral information.

problem Detecting changes in graph topology from graph signals.
method Leverages graph filtering and subspace detection to distill problem into a CUSUM-based algorithm.
result Demonstrates the effectiveness of incorporating prior spectral signatures for change-point detection.

The study finds bounds on homologically independent loops on hyperelliptic hyperbolic surfaces.

problem Finding bounds on the lengths of homologically independent loops on hyperelliptic hyperbolic surfaces.
method Analyzing the genus and using constant upper bounds on minimal length of non-zero period lattice vectors.
result For any λ(0,1)λ\in (0,1), there exists a constant N(λ)N(λ) such that every hyperelliptic hyperbolic surface has at least λ23gceil\lceil λ\cdot \frac{2}{3} g ceil homologically independent loops of length at most N(λ)N(λ).

Algorithm estimates graph structure with prior information and Langevin diffusion.

problem Support estimation of partially known Gaussian graphical models.
method Proposes an algorithm using annealed Langevin diffusion and graph neural networks to estimate the posterior distribution of the graph.
result Demonstrates the benefits of the approach through numerical experiments.

This is the beginning of an obstruction theory for deciding whether a map f:S^2 --> X^4 is homotopic to a topologically flat embedding, in the presence of fundamental group and in the absence of dual spheres. The first obstruction is Wall's self-intersection number mu(f) which tells the whole story in higher dimensions…

2000-08-07abs ↗pdf ↗

Study mini-batch SGD noise and its limits, proving complexity guarantees.

problem Analyzing the noise in mini-batch SGD and its impact on optimization.
method Examined the conditional covariance and diffusion limits of SGD under different sampling designs.
result Proved mean-square upper bounds and Fisher van Trees lower bounds for SGD, linking them to effective dimension and condition number.

Clarifies construction of K-contact non-Sasakian Smale-Barden manifolds.

problem Determining which Smale-Barden manifolds admit K-contact but not Sasakian structures.
method Explicitly determines the number of symplectic surfaces needed for isotropy loci, refines constructions of symplectic surfaces.
result Determines the number N of symplectic surfaces needed for K-contact but non-Sasakian manifolds.