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,657 papers · 148 categories

Trend · papers per month

140281421561 · Jun 202019922001200920172026
48 results for multiple points

New algorithms detect and react to multiple change points in online learning.

problem Learning under multiple change points in environments with unknown and frequent shifts.
method Proposed Anytime Tracking CUSUM (ATC) algorithms that balance detection of significant shifts.
result Properly tuned ATC algorithms achieve nearly minimax-optimal performance.

While Multiple Instance (MI) data are point patterns -- sets or multi-sets of unordered points -- appropriate statistical point pattern models have not been used in MI learning. This article proposes a framework for model-based MI learning using point process theory. Likelihood functions for point pattern data derived …

2017-03-07abs ↗pdf ↗

Study finds multiple solutions for Gross-Pitaevskii equations on curved spaces.

problem Finding multiple solutions for Gross-Pitaevskii equations on Riemannian manifolds.
method Critical point theory and Γ-convergence for Ginzburg-Landau functionals, plus new isoperimetric results.
result Lower bounds on the multiplicity of solutions in terms of the topology of the velocity set.

The study finds the minimum number of critical points for functionals on Frechet spaces and Finsler manifolds.

problem Finding the minimum number of critical points for functionals on Frechet spaces and Finsler manifolds.
method Applying the Lusternik-Schnirelmann category to evaluate the minimal number of critical points for Keller Cc1 C_c^1 -functionals on Frechet spaces and Finsler manifolds.
result The minimal number of critical points is determined by the Lusternik-Schnirelmann category.

Motivated by our attempt to recast Cartan's work on Lie pseudogroups in a more global and modern language, we are brought back to the question of understanding the linearization of multiplicative forms on groupoids and the corresponding integrability problem. From this point of view, the novelty of this paper is that w…

2012-10-08abs ↗pdf ↗

Proposes a method to estimate and infer networks from multiple high-dimensional point processes.

problem Estimating and inferring networks from multiple high-dimensional point processes with shared and unique structures.
method Joint estimation procedure for networks of high-dimensional point processes incorporating weights to encourage similarity.
result Powerful hierarchical multiple testing procedure for edges of all estimated networks, controlling family-wise error rate.

Study shows unique tangent cones for area-minimizing currents at boundary points.

problem Uniqueness of tangent cones for area-minimizing currents with arbitrary multiplicity.
method Analysis of area minimizing currents in C2C^2 submanifolds with arbitrary boundary multiplicity.
result Tangent cones are unique at density Q/2Q/2 boundary points.

We present the group fused Lasso for detection of multiple change-points shared by a set of co-occurring one-dimensional signals. Change-points are detected by approximating the original signals with a constraint on the multidimensional total variation, leading to piecewise-constant approximations. Fast algorithms are …

2011-06-21abs ↗pdf ↗

Geometric pruning rules improve change point detection in multiple time series.

problem Detecting multiple changes in multiple independent time series.
method Dynamic programming algorithms with inequality-based and geometric pruning rules.
result Geometric pruning rules offer close-to-linear time complexity for multiple independent time series.

The paper strengthens a theorem on crossings under linear perturbations with Hausdorff measure estimates.

problem Understanding multiple-point crossings under linear perturbations.
method Establishes a transversality theorem with Hausdorff measure estimates for exceptional parameter sets.
result Explicit upper bounds on the Hausdorff dimension of the exceptional set.

Let MM be a compact Riemannian manifold endowed with an isometric action of a compact Lie group. The method of the Witten deformation is used to compute the virtual representation-valued equivariant index of a transversally elliptic, first order differential operator on MM. The multiplicities of irreducible represent…

2006-10-04abs ↗pdf ↗

Given two points of a Generalized Robertson-Walker spacetime, the existence, multiplicity and causal character of geodesic connecting them is characterized. Conjugate points of such geodesics are related to conjugate points of geodesics on the fiber, and Morse-type relations are obtained. Applications to bidimensional …

2000-03-06abs ↗pdf ↗

We generalize the log Gaussian Cox process (LGCP) framework to model multiple correlated point data jointly. The observations are treated as realizations of multiple LGCPs, whose log intensities are given by linear combinations of latent functions drawn from Gaussian process priors. The combination coefficients are als…

2018-05-24abs ↗pdf ↗

We construct a 2-dimensional twisted nonabelian multiplicative integral. This is done in the context of a Lie crossed module (an object composed of two Lie groups interacting), and a pointed manifold. The integrand is a connection-curvature pair, that consists of a Lie algebra valued 1-form and a Lie algebra valued 2-f…

2010-07-07abs ↗pdf ↗

A new algorithm tackles bilevel optimization with multiple inner minima.

problem Challenges in bilevel optimization with multiple inner minima.
method Reformulated as constrained optimization, solved via primal-dual bilevel optimization (PDBO) algorithm.
result First non-asymptotic convergence guarantee for bilevel optimization with multiple inner minima.

Generalised matrix-matrix multiplication forms the kernel of many mathematical algorithms. A faster matrix-matrix multiply immediately benefits these algorithms. In this paper we implement efficient matrix multiplication for large matrices using the floating point Intel Pentium SIMD (Single Instruction Multiple Data) a…

2019-11-18abs ↗pdf ↗

Novel optimization method detects change points in Gaussian data.

problem Detecting change points in univariate Gaussian data sequences.
method Continuous optimization for best subset selection (COMBSS) applied to a reformulated statistical inverse problem.
result Adaptation and evaluation of COMBSS for offline normal mean multiple change-point detection.

The paper tackles efficient change point detection with limited samples.

problem Identifying multiple change points with minimal queries in noisy environments.
method Adaptive algorithm that first detects likely change points and refines their locations.
result The sample complexity is jointly governed by jump magnitudes and change point positions.

We give multiplicity results for the problem of prescribing the scalar curvature on Cauchy- Riemann spheres under Beta-flatness condition. To give a lower bound for the number of solutions, we use Bahri methods based on the theory of critical points at infinity and a Poincare-Hopf type formula.

2018-12-22abs ↗pdf ↗

We consider a continuous map f:MNf :M\to N between two manifolds and try to estimate its multiplicity from below, i.e. find a qq-tuple of pairwise distinct points x1,...,xqMx_1,..., x_q\in M such that f(x1)=f(x2)=...=f(xq)f(x_1) = f(x_2) = ... = f(x_q). We show that there are certain characteristic classes of vector bundle fTNTMf^*TN-TM that guarant…

2010-02-03abs ↗pdf ↗

Method constructs prediction intervals for time-varying individual treatment effects.

problem Accurately quantify uncertainty of individual treatment effects across multiple decision points.
method Conformal inference techniques for time-varying ITEs with weaker assumptions.
result Guaranteed lower bound for coverage dependent on data non-exchangeability.

We show that Tolman's example (of a six dimensional Hamiltonian T2T^2-space with isolated fixed points and no compatible Kähler structure) can be constructed from the flag variety U(3)/U(1)3U(3)/U(1)^3 by U(2)U(2)-equivariant symplectic surgery. This implies that Tolman's space has a ``transversal multiplicity-free'' action of $…

1995-06-22abs ↗pdf ↗

Study higher genus polylogarithms under Riemann surface degenerations.

problem Understanding higher genus polylogarithms under degenerations.
method Investigate the Enriquez connection for polylogarithms and show it becomes a known connection for families of Riemann surfaces.
result Higher genus polylogarithms can be described explicitly as power series in deformation parameters and logarithms of families.

This thesis is about the study of Lie groupoids endowed with a compatible (multiplicative) differential 1-form. The motivation and scope of the present work is to study the geometry of PDEs using the formalism of Lie groupoids and multiplicative forms; as such, ideas from the two theories have to be introduced and expl…

2013-06-05abs ↗pdf ↗

A Riemannian manifold is called Weyl homogeneous, if its Weyl tensors at any two points are "the same", up to a positive multiple. A Weyl homogeneous manifold is modeled on a homogeneous space M0M_0, if its Weyl tensor at every point is "the same" as the Weyl tensor of M0M_0, up to a positive multiple. We prove that a …

2009-12-30abs ↗pdf ↗

The paper studies how surfaces move by mean curvature flow and what happens at singular points.

problem Understanding the behavior of surfaces moving by mean curvature flow at singular points.
method Proves that tangent flows at singular times are smooth shrinkers, with a new local Gauss-Bonnet formula.
result Smooth shrinkers without branch points if the initial surface is embedded in 3-manifold.

Online detection of abrupt changes in high-dimensional data streams.

problem Detecting abrupt changes in high-dimensional, streaming data with multiple subspaces.
method Dynamic sparse subspace learning approach with multiple structural change-point model, Bayesian information criterion for penalty coefficients selection, and Pruned Exact Linear Time algorithm.
result Effectiveness demonstrated through simulation and real gesture data studies.