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

97194291388 · Jun 202019922001200920172026
48 results for Rectified Evaluation

In this paper we investigate the performance of different types of rectified activation functions in convolutional neural network: standard rectified linear unit (ReLU), leaky rectified linear unit (Leaky ReLU), parametric rectified linear unit (PReLU) and a new randomized leaky rectified linear units (RReLU). We evalu…

2015-05-05abs ↗pdf ↗

Study evaluates Tree-Ring Watermarking in rectified flow-based models, revealing detection and separability limitations.

problem Detecting and separating Tree-Ring Watermarks in rectified flow-based models.
method Extensive experimentation comparing SD 2.1 and FLUX.1-dev models with various text guidance configurations and augmentation attacks.
result Inversion limitations affect watermark recovery and statistical separation.

CRITS improves time series classification with interpretable local explanations.

problem Lack of detailed explanations in time series classification models.
method CRITS uses convolutional kernels, max-pooling, and rectified linear units to extract feature weights.
result CRITS provides intrinsically interpretable local explanations without requiring gradients or random perturbations.

Paper proposes efficient image inversion and editing using rectified stochastic differential equations.

problem Inversion and editing of real images using generative models.
method Proposes RF inversion using dynamic optimal control and a linear quadratic regulator, extending to stochastic sampler for Flux.
result Allows state-of-the-art performance in zero-shot inversion and editing, outperforming prior works.

This paper improves domain adaptation methods using graph embedding.

problem Alleviating distribution gaps between different data domains.
method Formulate domain adaptation as graph embedding, analyze loss functions, propose rectified evaluation protocol.
result Improved benchmarks on standard datasets demonstrate the effectiveness of the proposed methods.

A new acquisition function RMES improves Bayesian optimization performance.

problem Improper evaluation of mutual information in MES leads to suboptimal performance.
method Developed rectified MES (RMES) and used stochastic gradient ascent with reparameterization.
result RMES shows consistent improvement over MES in benchmarks and real-world problems.

A space curve in a Euclidean 3-space E3\mathbb E^3 is called a rectifying curve if its position vector field always lies in its rectifying plane. This notion of rectifying curves was introduced by the author in [Amer. Math. Monthly {\bf 110} (2003), no. 2, 147-152]. In this present article, we introduce and study the n…

2016-07-28abs ↗pdf ↗

Harmonic maps to Euclidean buildings have rectifiable singular strata.

problem Understanding the structure of singular points for harmonic maps.
method Defining singular strata and proving rectifiability using the rectifiable Reifenberg program.
result Rectifiability of singular strata for harmonic maps into FF-connected complexes.

We prove (without using Federer's structure theorem) that a finite-mass flat chain over any coefficient group is rectifiable if and only if almost all of its 0-dimensional slices are rectifiable. This implies that every flat chain of finite mass and finite size is rectifiable. It also leads to a simple necessary and su…

1999-07-01abs ↗pdf ↗

New methods for solving hydrodynamic-type equations using quasi-rectifiable Lie algebras.

problem Solving systems of hydrodynamic-type equations.
method Introducing and analyzing quasi-rectifiable Lie algebras and vector fields.
result New methods for solving hydrodynamic-type equations.

The paper generalizes rectifying and normal curves in Lorentzian n-space.

problem Characterizing and classifying gg-rectifying and gg-normal curves in Lorentzian n-space.
method Introducing a gg-position vector field and defining gg-rectifying and gg-normal curves based on this field.
result Comprehensive characterization and classification of gg-rectifying and gg-normal curves.

Neural networks can approximate rectifiable measures with small error.

problem Approximating complex rectifiable measures using neural networks.
method Using ReLU neural networks to approximate (countably) m-rectifiable measures as push-forwards of the Lebesgue measure.
result The approximation error in terms of Wasserstein distance can be made arbitrarily small.

We show that C^1 hypersurfaces in the Heisenberg group are countably N-rectifiable. As a corollary, this shows that all C^1_H graphs over the xy-plane are countable N-rectifiable, showing the equivalence of this notion of rectifiability with that of Franchi, Serra Cassano and Serapioni for such surfaces.

2004-07-13abs ↗pdf ↗

In this paper, we introduce transformations of deep rectifier networks, enabling the conversion of deep rectifier networks into shallow rectifier networks. We subsequently prove that any rectifier net of any depth can be represented by a maximum of a number of functions that can be realized by a shallow network with a …

2017-03-30abs ↗pdf ↗

In Heisenberg groups, rectifiability is studied for subsets using C1,αC^{1,α}-regular surfaces.

problem Understanding rectifiability of subsets in Heisenberg groups.
method Introducing a new notion of rectifiability and proving conditions for rectifiability using tangent paraboloids.
result A sufficient condition for C1,αC^{1,α}-rectifiability of low-codimensional subsets in Heisenberg groups is the existence of suitable approximate tangent paraboloids.

The paper characterizes rectifying curves on smooth surfaces using isometries and Darboux frames.

problem Characterizing rectifying curves on smooth surfaces under isometries.
method Using Darboux frames and isometries to investigate rectifying curves.
result Find deviations of rectifying curves under isometries and analyze their properties.

In this paper, we introduce a new class of curves αcalled a f-rectifying curves, which its f-position vector defined by α_{f}(s)=\int f(s)T(s)ds always lie in the rectifying plane of α, where f is an integrable function and T is the speed curve of α. In particular case, when the function f=0 or constant, the class of f…

2018-10-21abs ↗pdf ↗

Rectified flows achieve optimal sample complexity for generating data.

problem Generating high-quality data samples efficiently.
method Rectified flows constrain transport trajectories to be linear, enabling efficient sampling.
result Achieve sample complexity of ildeO(ε2) ilde{O}(\varepsilon^{-2}), matching optimal rate for mean estimation.

The paper explores rectified flows and their relation to optimal transport.

problem Understanding the connection between rectified flows and optimal transport.
method Investigates invariance properties, explicit constructions, and analysis of rectified flows in various settings.
result Rectified flows, when gradient constrained, do not generally solve optimal transport problems.

We extend rectified flow to infinite-dimensional Hilbert space.

problem Extending rectified flow to infinite-dimensional spaces.
method Established a rigorous functional formulation using the superposition principle for continuity equations.
result Demonstrated superior performance compared to existing models.

AReLU uses attention-based rectification to improve neural network performance.

problem Improving neural network performance through better activation functions.
method Integrates attention mechanism with rectified linear unit (ReLU) to learn and scale feature maps.
result AReLU significantly boosts performance of most network architectures with minimal changes.

The rectified flow method is analyzed for its statistical properties.

problem Theoretical support for rectified flow methods is lacking.
method Empirical analysis of rectified flow's statistical properties using regression and density estimation.
result Convergence rates for rectified flow estimators are faster than for nonparametric regression and density estimation.

Study rectifying submanifolds with anti-torqued axis in Riemannian manifolds.

problem Characterize submanifolds with anti-torqued axis in Riemannian manifolds.
method Determine necessary and sufficient conditions for anti-torqued vector fields, characterize submanifolds, and derive rectifying submanifolds as warped products.
result Rectifying submanifolds with anti-torqued axis are warped products with specific warping functions.

In this article, we study rectifying curves in arbitrary dimensional Euclidean space. A curve is said to be a rectifying curve if, in all points of the curve, the orthogonal complement of its normal vector contains a fixed point. We characterize rectifying curves in the nn-dimensional Euclidean space in different ways…

2018-06-28abs ↗pdf ↗

Paper proposes a new activation function to reduce overfitting and large weight update issues.

problem Overfitting and large weight update problems in neural networks.
method Introduces a new activation function called Thresholded Exponential Rectified Linear Units (TERELU).
result TERELU shows better performance in reducing overfitting and large weight update issues compared to other activation functions.

Study local minimizers of Ginzburg-Landau functionals in high dimensions, showing energy measures converge to rectifiable measures.

problem Investigating minimizers of Ginzburg-Landau functionals in high dimensions with energy bounds.
method Analyzing minimizers with logarithmic energy bounds and considering the vacuum manifold's homotopy classes.
result Normalized energy measures converge to an (n2)(n-2)-rectifiable measure associated with a stationary varifold.

This paper studies rectifiability in Carnot groups and proves geometric area formulas.

problem The study of rectifiability in Carnot groups and related geometric properties.
method Analysis of rectifiable measures in Carnot groups, geometric area formulas, and rectifiability of geodesic spheres.
result Geometric area formula for the centered Hausdorff measure restricted to intrinsically differentiable graphs in Carnot groups.

FlowChef steers RFMs to efficiently guide image generation tasks.

problem Efficiently guiding image generation tasks with RFMs.
method Developed a theoretical and empirical understanding of RFMs' vector field dynamics, proposing FlowChef for gradient-free navigation.
result FlowChef significantly outperforms baselines in performance, memory, and time requirements.

We introduce a notion of rectifiability modeled on Carnot groups. Precisely, we say that a subset E of a Carnot group M and N is a subgroup of M, we say E is N-rectifiable if it is the Lipschitz image of a positive measure subset of N. First, we discuss the implications of N-rectifiability, where N is a Carnot group (n…

2000-04-11abs ↗pdf ↗

Rectifies flat singular points for area-minimizing currents.

problem Understanding singularities of area-minimizing currents.
method Analyzes countably (m2)(m-2)-rectifiable singular points with flat tangent cones.
result The set of singular density-QQ points is countably (m2)(m-2)-rectifiable and has finite upper Minkowski content.

Rectifies flat singular points of area-minimizing currents with singularity degree > 1.

problem Rectifying flat singular points of area-minimizing currents with singularity degree > 1.
method Subdividing singular points based on singularity degree and proving rectifiability of points with singularity degree > 1.
result The set of points with singularity degree > 1 is (m-2)-rectifiable.