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

Trend · papers per month

167333500666 · Jun 202019922001200920172026
48 results for functional profiles

Framework detects shape shifts in functional profiles using Fréchet mean and shape invariant model.

problem Detecting shape shifts in functional profiles.
method Combining Fréchet mean and shape invariant model for interpretable parameterization of profile deviations.
result Potential shifts in shape deformation process distinguished by significant shifts in amplitude and/or phase.

Study compares isoperimetric profiles on manifolds with integral Ricci curvature bounds.

problem Comparing isoperimetric profiles on manifolds with integral Ricci curvature bounds.
method Extending previous work, the study uses integral bounds on Ricci curvature to prove comparison results for isoperimetric profile functions.
result Comparison results for the Isoperimetric profile function in manifolds with integral bounds on Ricci curvature.

We establish the existence, finiteness, and uniqueness up to scaling of various isoperimetric profiles of a group, in all dimensions. We also show that these profiles all coincide in dimensions 4 and higher; in particular, the nth Dehn function is equal to FV^{n+1} for n at least 3. Even for dimension 3, there is signi…

2009-01-15abs ↗pdf ↗

New method for unbinned, profiled unfolding in particle physics.

problem Traditional unfolding methods are limited in the number of unfolded variables and cannot profile nuisance parameters.
method Proposes a machine learning-based method that allows for unbinned differential cross sections and profiles nuisance parameters.
result Demonstrates the method with Gaussian examples and a simulated Higgs boson cross section measurement.

The virtualization of compute and network resources enables an unseen flexibility for deploying network services. A wide spectrum of emerging technologies allows an ever-growing range of orchestration possibilities in cloud-based environments. But in this context it remains challenging to rhyme dynamic cloud configurat…

2019-11-18abs ↗pdf ↗

Study of integral flows on Riemannian manifolds with focus on blow-up profiles and concentration-compactness.

problem Analyzing nonlinear integral flows on Riemannian manifolds with specific focus on blow-up profiles and concentration-compactness.
method Investigation of a family of nonlinear integral flows involving Riesz potentials, focusing on the Hardy-Littlewood-Sobolev (HLS) subcritical and critical regimes.
result Established convergence on unit spheres and certain locally conformally flat manifolds for the dual Yamabe flow.

New method resolves causal heterogeneity by defining a resolution profile.

problem Causal subgroup analyses often oversimplify heterogeneity into a small number of groups.
method Introduces a resolution profile as a functional of the causal feature law, using Bayesian-bootstrap inference.
result Shows that the resolution profile is a continuous path with discontinuities at knots, providing integer-valued subgroup numbers.

We show that the Cheeger constant of compact surfaces is bounded by a function of the area. We apply this to isoperimetric profiles of bounded genus non-compact surfaces, to show that if their isoperimetric profile grows faster than t\sqrt t, then it grows at least as fast as a linear function. This generalizes a resu…

2007-06-29abs ↗pdf ↗

Modeling curvature-sensitive cells in visual cortex using manifold geometry.

problem Understanding how curvature influences cell function in the visual cortex.
method Developed a 4D manifold with canonical Engel structure to represent orientation, position, curvature, and scale.
result Characterized curvature-sensitive receptive profiles using left-invariant generators of the Engel structure.

Profile entropy measures learnability and compressibility of discrete distributions.

problem Understanding the learnability and compressibility of discrete distributions.
method Investigates profile entropy, showing its role in estimation, inference, and compression.
result Profile entropy is a fundamental measure unifying estimation, inference, and compression.

The paper explores inequalities for strongly-convex sets in weighted Riemannian manifolds.

problem Investigating dilation type inequalities on weighted Riemannian manifolds.
method Introducing dilation profile and comparing it with model space under lower weighted Ricci curvature bounds.
result Showed several functional inequalities related to various entropies.

A method for profiling systematic uncertainties in SBI using Factorizable Normalizing Flows.

problem Computational cost and limited applicability of current SBI methods for realistic analyses.
method Simulation-Based Inference with Factorizable Normalizing Flows to model systematic variations.
result Efficient profiling of nuisance parameters and multivariate DoI in complex analyses.

Method controls extrapolation in prediction profiles for statistical and machine learning models.

problem Avoiding invalid predictions due to extrapolation in prediction profiles.
method Genetic algorithm optimization over constrained factor regions.
result Optimal factor settings without constraint are often invalid and extrapolated.

This article is about a natural distance function induced by smooth cobordisms between links. We show that the cobordism distance of torus links is determined by the profiles of their signature functions, up to a constant factor.

2010-11-03abs ↗pdf ↗

We equip many non compact non simply connected surfaces with smooth Riemannian metrics whose isoperimetric profile is smooth, a highly non generic property. The computation of the profile is based on a calibration argument, a rearrangement argument, the Bol-Fiala curvature dependent inequality, together with new result…

2007-01-07abs ↗pdf ↗

We introduce a spectrum of monotone coarse invariants for metric measure spaces called Poincaré profiles. The two extremes of this spectrum determine the growth of the space, and the separation profile as defined by Benjamini--Schramm--Timár. In this paper we focus on properties of the Poincaré profiles of groups with …

2017-07-07abs ↗pdf ↗

Let X be a finite CW complex or compact Lipschitz neighborhood retract with universal cover Z; let M be a compact orientable manifold of dimension at least 2 and nonempty boundary. We establish the existence of an isoperimetric profile for functions from M to Z, in the metric and cellular senses, and show that they are…

2009-01-15abs ↗pdf ↗

Logarithmic separation profile in hyperbolic groups shows hierarchical structure.

problem Understanding hierarchical structure in hyperbolic groups with logarithmic separation.
method Proving groups with logarithmic separation split over cyclic groups and providing counterexamples.
result Not all groups with hierarchical structure have logarithmic separation profile.

K-Models clusters functional data with ordinal constraints for better interpretability.

problem Challenges in extracting meaningful insights from functional data due to lack of interpretability.
method Integrates ordinal constraints into clustering to improve interpretability and structure identification.
result Enhances interpretability of clustering results while maintaining performance.

Recently, researchers have started decomposing deep neural network models according to their semantics or functions. Recent work has shown the effectiveness of decomposed functional blocks for defending adversarial attacks, which add small input perturbation to the input image to fool the DNN models. This work proposes…

2019-04-17abs ↗pdf ↗

We provide an isoperimetric comparison theorem for small volumes in an nn-dimensional Riemannian manifold (Mn,g)(M^n,g) with strong bounded geometry, as in Definition 2.32.3, involving the scalar curvature function. Namely in strong bounded geometry, if the supremum of scalar curvature function Sg<n(n1)k0S_g<n(n-1)k_0 for some $k_…

2016-11-05abs ↗pdf ↗

Estimates lower bounds for isoperimetric profiles and improves on previous estimates for specific manifolds.

problem Estimating lower bounds for isoperimetric profiles of specific Riemannian manifolds.
method Explicit lower bounds for isoperimetric profiles of Riemannian product manifolds.
result Improved lower bounds for isoperimetric profiles and Yamabe constants.

In the context of sub-Riemannian Heisenberg groups Hn, n \geq 1, we shall study Isoperimetric Profiles, which are closed compact hypersurfaces having constant horizontal mean curvature, very similar to ellipsoids. Our main goal is to study the stability of Isoperimetric Profiles.

2011-10-04abs ↗pdf ↗

A novel criterion selects optimal distance metrics for cell profile analysis.

problem Determining the most accurate distance metric for high-dimensional cell profiles.
method Generalized proposition and corollaries to evaluate and select distance metrics.
result Wasserstein and cosine similarity metrics are optimal for general cases.

Paper describes profiles of multivariate normal distributions and novel estimators for mutual information.

problem Estimating mutual information for complex distributions.
method Analytical description of profiles, introduction of Bend and Mix Models, Monte Carlo estimation.
result Bend and Mix Models accurately estimate mutual information profiles and provide Bayesian estimates.

Expanding on techniques of concentration of measure, we develop a quantitative framework for modeling liquidity risk using convex risk measures. The fundamental objects of study are curves of the form (ρ(λX))λ0(ρ(λX))_{λ\ge 0}, where ρρ is a convex risk measure and XX a random variable, and we call such a curve a \emph{liqu…

2015-10-23abs ↗pdf ↗

Random layer-wise pruning profiles are as effective as metric-based ones for various datasets.

problem Reduction of model size and computational resources in neural networks.
method Conducted baseline experiments, developed RL-based search algorithm for finding transferable layer-wise pruning profiles.
result RL-based layer-wise pruning profiles are as good or better than best profiles found on the original dataset via exhaustive search.

Study optimizes perimeter in convex domains with anisotropic constraints.

problem Optimizing perimeter in convex domains with anisotropic constraints.
method Analytical properties, topological features, and geometric measure theory results.
result Sharp isoperimetric inequalities and existence of minimizers.

The vanishing of reduced 2\ell^2-cohomology for amenable groups can be traced to the work of Cheeger & Gromov. The subject matter here is reduced p\ell^p-cohomology for p]1,[p \in ]1,\infty[, particularly its vanishing. Results showing its triviality are obtained, for example: when p]1,2]p \in ]1,2] and GG is amenable; whe…

2013-03-17abs ↗pdf ↗

The study analyzes how large language models form and express investor risk profiles.

problem Understanding how large language models (LLMs) form and express investor risk profiles.
method Examined three LLMs (GPT, Gemini, and Llama) and assessed their responses to a standardized risk questionnaire under varying prompts.
result LLMs generally form long-term investment profiles, but they exhibit different risk tolerance levels.

Uniform Lipschitz continuity of isoperimetric profiles in evolving surfaces.

problem Uniform Lipschitz continuity of isoperimetric profiles in evolving surfaces.
method Normalized Ricci flow on compact surfaces.
result Uniform Lipschitz continuity of isoperimetric profiles under normalized Ricci flow.

A new framework for adaptive behavior using reusable value profiles.

problem Adaptive behavior in changing environments requires switching among value-control regimes, but maintaining separate parameters for each situation is impractical.
method Introduces value profiles: reusable bundles of parameters assigned to hidden states, allowing for state-conditional strategy recruitment without independent parameters for each context.
result Profile-based models outperform simpler alternatives in probabilistic reversal learning, suggesting belief-dependent control of adaptive behavior.

The hypercube's perimeter is significantly larger than expected near half volume.

problem Understanding the isoperimetric profile of the hypercube.
method Analytical proof of perimeter bounds and comparison to Gaussian isoperimetric profile.
result The isoperimetric profile of the hypercube does not converge to the Gaussian profile as dimension increases.