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

3396791,0181,357 · Jun 202019922001200920172026
48 results for Data Envelopment Analysis

Paper presents a method for identifying isotope envelopes in MALDI-ToF data.

problem Deisotoping of isotopic peaks in MALDI-ToF molecular imaging data.
method Uses Mamdani-Assilan fuzzy system and spatial maps of molecular distribution to identify isotope envelopes.
result Proposed method detects overlapping envelopes and analyzes large data sets.

A nonparametric method for time series analysis extracts envelopes, detects peaks, and clusters data.

problem Extracting envelopes, detecting peaks, and clustering in time series data.
method Iterative procedure that minimizes L1L_1 drift to create upper and lower bounding signals, using Viterbi-like path tracking and optimal elimination rules.
result Efficiently calculated solution with near-linear time complexities for various applications.

The dynamical analysis of American options has motivated the development of robust versions of the classical Snell envelopes. The cost of superhedging an American option is characterized by the upper Snell envelope. The infimum of the arbitrage free prices is characterized by the lower Snell envelope. In this paper we …

2009-02-24abs ↗pdf ↗

The paper introduces a method to learn and apply value envelopes for faster online reinforcement learning.

problem Accelerating online reinforcement learning using offline data with theoretical grounding.
method A two-stage framework: offline data for learning value bounds, online algorithms for applying them.
result Substantial regret reductions in empirical tests on tabular MDPs.

Study benchmarks mutual funds in India using DEA, finding efficiency metrics.

problem Benchmark mutual funds in India based on efficiency metrics.
method Data Envelopment Analysis (DEA) model incorporating risk, cost, return, and information ratio.
result DEA model identifies efficiency frontier and compares results with traditional metrics.

Proposes a method for evaluating multiple dimensions of organizational effectiveness using DEA.

problem Evaluating multiple dimensions of organizational effectiveness in large data sets.
method Introduces two regularized DEA models (SBM and GP-SBM) to estimate both dimension-specific and aggregate efficiency scores.
result Demonstrates improved efficiency and validity compared to conventional methods.

Defines a calculus for integrating Moreau envelopes in differentiable programming.

problem Lack of a mathematical framework for applying Moreau envelopes to deep networks and machine learning systems.
method Develops a compositional calculus adapted to Moreau envelopes and integrates it into differentiable programming.
result Integrates Moreau envelopes into differentiable programming, enabling new gradient back-propagation methods.

Study analyzes profitability and efficiency of Chinese banks, finding state-owned banks superior.

problem Analyzing efficiency and profitability of Chinese banks over time.
method Used Data envelopment analysis (Super-SBM-UND-VRS based DEA) model considering non-performing loans as undesired output.
result State-owned banks and Rural/City Commercial Banks have better profitability super-efficiency than Joint-stock Banks.

Improves regression efficiency by separating material and immaterial parts of responses.

problem Improving estimation efficiency in nonlinear multivariate regressions.
method Kernel envelope (KENV) estimator for nonparametric response envelopes in reproducing kernel Hilbert space.
result KENV achieves lower in-sample prediction risk than kernel ridge regression in non-trivial immaterial components.

New Langevin Monte Carlo algorithms for sampling from nonsmooth distributions.

problem Sampling from distributions with nonsmooth convex composite potentials.
method Leveraging Bregman--Moreau envelopes and proximal operators in mirror descent.
result Efficiency in sampling from nonsmooth distributions, extending existing methods.

Separation of the sources and analysis of their connectivity have been an important topic in EEG/MEG analysis. To solve this problem in an automatic manner, we propose a two-layer model, in which the sources are conditionally uncorrelated from each other, but not independent; the dependence is caused by the causality i…

2012-03-15abs ↗pdf ↗

Study finds super-efficiency correlates more strongly with stock market valuation than ROA in Chinese banks.

problem Investigating the relationship between bank efficiency and stock market valuation.
method Employed a non-radial, non-oriented slack-based super-efficiency Data Envelopment Analysis (Super-SBM-UND-VRS) model, treating NPLs as undesired output.
result Super-efficiency is more strongly correlated with stock market valuation than ROA, as measured by Tobin's Q.

Recent advances in analysis of subband amplitude envelopes of natural sounds have resulted in convincing synthesis, showing subband amplitudes to be a crucial component of perception. Probabilistic latent variable analysis is particularly revealing, but existing approaches don't incorporate prior knowledge about the ph…

2018-02-02abs ↗pdf ↗

Paper proposes a new method to stabilize noisy gradient algorithms.

problem Stochastic-gradient Langevin algorithms can introduce bias when taming denominators depend on stochastic-gradient realizations.
method Proposes a structure-preserving framework for designing tamed denominators that avoid unnecessary taming and maintain the stabilizing effect of taming.
result The method avoids stationary bias and explains the stationary error split into bias and remaining error.

Training certifiable neural networks enables one to obtain models with robustness guarantees against adversarial attacks. In this work, we introduce a framework to bound the adversary-free region in the neighborhood of the input data by a polyhedral envelope, which yields finer-grained certified robustness. We further …

2019-12-10abs ↗pdf ↗

This paper explores geometric insights into discrete R-congruences and their envelopes.

problem Understanding the ambiguity in discrete R-congruences and their envelopes.
method Analyzes discrete R-congruences that are enveloped by specific types of surfaces and maps.
result Discovers a 2-parameter family of discrete enveloping surfaces for discrete R-congruences.

Study on Laplacian determinant in isosceles triangles, finding equilateral triangle minimizes determinant.

problem Finding the minimum of the spectral determinant on isosceles triangles.
method Analyzing the determinant of the Laplacian on Euclidean isosceles triangle envelopes of fixed area.
result Equilateral triangle envelope minimizes the determinant of the Laplacian.

This work uses Lasry-Lions envelopes to solve nonconvex optimization problems.

problem Nonconvex and nonsmooth terms in optimization problems.
method Develops a homotopy approach using Lasry-Lions envelopes to approximate and solve the original problem.
result The method can solve composite minimization problems and is more effective than classical alternatives in certain domains.

We make a systematic study of (quasi-)plurisubharmonic envelopes on compact Kähler manifolds, as well as on domains of Cn\mathbb{C}^n, by using and extending an approximation process due to Berman [Ber13]. We show that the quasi-psh envelope of a viscosity super-solution is a pluripotential super-solution of a given co…

2017-03-15abs ↗pdf ↗

Given a collection of data points, non-negative matrix factorization (NMF) suggests to express them as convex combinations of a small set of `archetypes' with non-negative entries. This decomposition is unique only if the true archetypes are non-negative and sufficiently sparse (or the weights are sufficiently sparse),…

2017-05-08abs ↗pdf ↗

New methods help escape strict saddle points in nonsmooth optimization.

problem Escaping strict saddle points in nonsmooth optimization.
method An inexact stochastically perturbed gradient method applied to the Moreau envelope.
result A variety of algorithms for nonsmooth optimization can efficiently escape strict saddle points of the Moreau envelope.

We prove that the forgetful functor from groupoids to pregroupoids has a left adjoint, with the front adjunction injective. Thus we get an enveloping groupoid for any pregroupoid. We prove that the category of torsors is equivalent to that of pregroupoids. Hence we also get enveloping groupoids for torsors, and for pri…

2005-02-03abs ↗pdf ↗

We give a global description of envelopes of geodesic tangents of regular curves in (not necessarily convex) Riemannian surfaces. We prove that such an envelope is the union of the curve itself, its inflectional geodesics and its tangential caustics (formed by the conjugate points to those of the initial curve along th…

2004-11-19abs ↗pdf ↗

By using the support function on the xyxy-plane, we show the necessary and sufficient conditions for the existence of envelopes of horizontal lines in the 3D-Heisenberg group. A method to construct horizontal envelopes from the given ones is also derived, and we classify the solutions satisfying the construction.

2018-01-13abs ↗pdf ↗

We view conformal surfaces in the 4--sphere as quaternionic holomorphic curves in quaternionic projective space. By constructing enveloping and osculating curves, we obtain new holomorphic curves in quaternionic projective space and thus new conformal surfaces. Applying these constructions to Willmore surfaces, we show…

2003-06-09abs ↗pdf ↗

pFedMe uses Moreau envelopes to improve personalized FL performance.

problem Statistical diversity among clients limits FL performance.
method pFedMe employs Moreau envelopes as clients' regularized loss functions in a bi-level optimization problem.
result pFedMe achieves state-of-the-art convergence rates and superior empirical performance.

Smooth convergence to an enveloping cylinder proved for mean curvature flow of complete graphical hypersurfaces.

problem Proving smooth convergence of mean curvature flow to an enveloping cylinder.
method Analyzing mean curvature flow of complete graphical hypersurfaces over domains ΩtΩ_{t}, proving convergence under certain circumstances.
result Smooth convergence of Mthen+1M_{t}-h\,e_{n+1} to the enveloping cylinder under specific conditions.

We study the geometry of Outer Space CVnCV_n in regard of the asymmetric Lipschitz metric via envelopes, that is the set of all geodesics between two points. In the simplicial structure of CVnCV_n the envelopes are polytopes. We construct a piecewise unique geodesic between any two points in CVnCV_n by concatenating edges…

2019-07-15abs ↗pdf ↗

We consider smooth 1-parameter families of plane curves tangent to a semicubic parabola, when the curvature radius of their curves at the tangency point vanishes at the cusp point. We find the $\A$-normal form of these families, their envelopes and local patterns near the cusp. We obtain a new codimension 2 singularity…

2005-11-21abs ↗pdf ↗

A spacetime can be embedded in an enveloping space with all its extensions.

problem Existence and uniqueness of C0-maximal extensions in globally hyperbolic conformally flat spacetimes.
method Proving conformal embedding into an enveloping space containing all extensions.
result Existence and uniqueness of C0-maximal extensions proven.

The envelope of straight lines affine normal to a plane curve C is its affine evolute; the envelope of the affine lines tangent to C is the original curve, together with the entire affine tangent line at each inflexion of C. In this paper, we consider plane curves without inflexions. We use some techniques of singulari…

2017-05-04abs ↗pdf ↗