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

108217325433 · Jun 202019922001200920172026
48 results for bounded regions

Improved bounds on neural network regions using activation histograms.

problem Bounding the number of affine regions in ReLU networks.
method Analysis of algebraic topology problem, extension of framework to subnetwork composition.
result Slightly tighter bounds and insights into parameter initialization.

Study shows how near crushing singularities, Kasner-like regions can exist.

problem Understanding spatial volume densities near crushing singularities.
method Relates existence of Kasner-like regions to asymptotics of spatial volume densities under scale-invariant curvature bounds.
result Kasner-like regions can exist near crushing singularities under certain curvature conditions.

The study estimates the expressiveness of GCNs with bounds on the number of linear regions.

problem Characterizing the expressiveness of graph convolutional networks (GCNs).
method Estimates the number of linear regions for one-layer and multi-layer GCNs.
result GCNs with multiple layers have exponentially more expressivity per parameter than one-layer GCNs.

Study on bit threads and their locking properties in holographic spacetimes.

problem Understanding the conditions under which regions can be locked in holographic spacetimes.
method Investigation of different density bounds and their implications on the locking of regions.
result Non-crossing regions can be locked under the most stringent bound, but crossing regions cannot.

A new method to measure neural network expressiveness using tighter upper bounds.

problem Measuring the expressiveness of deep neural networks (DNNs).
method Proposes a new tighter upper bound for the number of linear regions in rectifier networks, using matrix computation.
result The proposed upper bound is tighter than existing ones and explains the performance improvements of skip connections and residual structures.

Estimates the upper bound of linear regions in spheres centered at specific data points in ReLU neural networks.

problem Bounding the number of linear regions in specific areas of neural networks using ReLU activations.
method Developed a method to estimate the upper bound of linear regions in any sphere within the input space of a ReLU neural network.
result The boundaries of linear regions move away from training data points during training, and spheres centered at these points contain more regions than arbitrary points.

Using region crossing changes, we define a new invariant called the multi-region index of a knot. We prove that the multi-region index of a knot is bounded from above by twice the crossing number of the knot. In addition, we show that the minimum number of generators of the first homology of the double branched cover o…

2019-09-26abs ↗pdf ↗

We can compare the expressiveness of neural networks that use rectified linear units (ReLUs) by the number of linear regions, which reflect the number of pieces of the piecewise linear functions modeled by such networks. However, enumerating these regions is prohibitive and the known analytical bounds are identical for…

2018-10-08abs ↗pdf ↗

We investigate the complexity of deep neural networks (DNN) that represent piecewise linear (PWL) functions. In particular, we study the number of linear regions, i.e. pieces, that a PWL function represented by a DNN can attain, both theoretically and empirically. We present (i) tighter upper and lower bounds for the m…

2017-11-06abs ↗pdf ↗

This work generalizes bounds on the number of linear regions in CPWL NNs.

problem Determining the number of linear regions in CPWL neural networks is challenging.
method Generalized bounds on the maximal number of linear regions for arbitrary CPWL activation functions.
result Depth significantly increases the number of linear regions, but not exponentially.

Given a discrete subgroup of the isometries of n-dimensional hyperbolic space there is always a region kept precisely invariant under the stabilizer of a parabolic fixed point, called the Margulis region. While in dimensions 2 and 3 this region is a horoball, it has in general a more complicated shape due to the existe…

2012-09-25abs ↗pdf ↗

The paper improves confidence regions for band-limited functions using tighter norm bounds and majority voting.

problem Constructing reliable confidence regions for band-limited functions from noisy data.
method Improved norm bounds using Hoeffding's inequality and empirical Bernstein bound, majority voting to aggregate intervals.
result Confidence intervals retain their simultaneous coverage guarantee even when aggregated from random subsamples.

Defines renormalized volume for bounded regions in asymptotically hyperbolic Einstein spaces.

problem Calculating the volume of bounded regions in complex geometries.
method Defines renormalized volume, proves Gauss-Bonnet theorem, computes derivative under variations.
result Derives a Gauss-Bonnet theorem for the renormalized volume.

Bayesian model averaging under predictor redundancy

problem Reporting Bayesian model averaging posterior without changing the Bayesian target
method Using hard or soft regions of support space
result Region reports often give shorter and clearer summaries while preserving the main posterior information

TRM improves long-horizon LLM RL by masking divergent sequences.

problem Long-horizon reinforcement learning with LLMs suffers from off-policy mismatch and approximation errors.
method Derives and applies trust region bounds to control divergence, proposing Trust Region Masking.
result First non-vacuous monotonic improvement guarantees for long-horizon LLM-RL.

TRM improves long-horizon reinforcement learning for LLMs by masking divergent sequences.

problem Long-horizon reinforcement learning for LLMs suffers from off-policy mismatch and approximation errors.
method Derives and applies trust region bounds to control divergence, proposing Trust Region Masking.
result First non-vacuous monotonic improvement guarantees for long-horizon LLM-RL.

Recently dictionary screening has been proposed as an effective way to improve the computational efficiency of solving the lasso problem, which is one of the most commonly used method for learning sparse representations. To address today's ever increasing large dataset, effective screening relies on a tight region boun…

2016-08-21abs ↗pdf ↗

Stochastic partition models divide a multi-dimensional space into a number of rectangular regions, such that the data within each region exhibit certain types of homogeneity. Due to the nature of their partition strategy, existing partition models may create many unnecessary divisions in sparse regions when trying to d…

2019-03-10abs ↗pdf ↗

In this paper we consider the problem of minimizing the relative perimeter under a volume constraint in the interior of a conically bounded convex set, i.e., an unbounded convex body admitting an \emph{exterior} asymptotic cone. Results concerning existence of isoperimetric regions, the behavior of the isoperimetric pr…

2014-04-01abs ↗pdf ↗

We show that for a large class of hyperbolic knots and links, we can determine bounds on the volume of the link complement from combinatorial information given by a link diagram. Specifically, there is a universal constant C such that if a knot or link admits a prime, twist reduced diagram with at least 2 twist regions…

2006-04-21abs ↗pdf ↗

The paper extends Reshetnyak's theorem to Lorentzian length spaces with upper curvature bounds.

problem Characterizing upper curvature bounds in Lorentzian geometry.
method Analogous to Reshetnyak's theorem, using convex regions and 1-anti-Lipschitz maps.
result Characterization of upper curvature bounds via four-point configurations.

We derive Gaussian approximations for random forest predictions using region-based stabilization.

problem Improving the accuracy of random forest predictions for Poisson process data.
method Region-based stabilization and Malliavin-Stein method for multivariate Gaussian approximation.
result Established Gaussian approximation bounds for random forest predictions under Poisson process.

Neural network accuracy improves with denser training samples.

problem Improving neural network accuracy on unseen test samples.
method Bounding empirical training error smoothed across activation regions and using it to discard high-risk test samples.
result Discarding high-risk test samples based on error bounds improves prediction accuracy by up to 20%.

The SPS method constructs confidence regions for true parameters with optimal sample complexity.

problem Constructing exact, non-asymptotic confidence regions for true system parameters.
method Sign-Perturbed Sums (SPS) method, generalized to various types of problems.
result High probability upper bounds for SPS confidence regions show optimal shrinkage rate.

We show that if a knot admits a prime, twist-reduced diagram with at least 4 twist regions and at least 6 crossings per twist region, then every non-trivial Dehn filling of that knot is hyperbolike. A similar statement holds for links. We prove this using two arguments, one geometric and one combinatorial. The combinat…

2004-12-15abs ↗pdf ↗

We consider the problem of model selection in Gaussian Markov fields in the sample deficient scenario. The benchmark information-theoretic results in the case of d-regular graphs require the number of samples to be at least proportional to the logarithm of the number of vertices to allow consistent graph recovery. When…

2018-02-12abs ↗pdf ↗

In this paper, we discuss the region unknotting number of different classes of 2-bridge knots. In particular, we provide region unknotting number for the classes of 22-bridge knots whose Conway notation is C(m, n),C(m, 2, m),C(m,\ n), C(m,\ 2,\ m), C(m, 2, m±1) C(m,\ 2,\ m\pm1) and C(2, m, 2, n)C(2,\ m,\ 2,\ n). By generalizing, we also provide a sharp up…

2014-07-10abs ↗pdf ↗

Region-specific linear models are widely used in practical applications because of their non-linear but highly interpretable model representations. One of the key challenges in their use is non-convexity in simultaneous optimization of regions and region-specific models. This paper proposes novel convex region-specific…

2014-10-31abs ↗pdf ↗

In this paper, aimed at exploring the fundamental properties of isoperimetric region in 33-manifold (M3,g)(M^3,g) which is asymptotic to Anti-de Sitter-Schwarzschild manifold with scalar curvature R6R\geq -6, we prove that connected isoperimetric region {Di}\{D_i\} with Hg3(Di)δ0>0\mathcal{H}_g ^3(D_i)\geq δ_0>0 cannot slide off to …

2015-12-09abs ↗pdf ↗

New concepts of barriers and black regions defined for Lorentzian manifolds.

problem Understanding causal world-lines and horizons in Lorentzian manifolds.
method Proving properties of null hypersurfaces and their causal world-lines.
result Null hypersurfaces are semi-permeable, leading to new concepts of barriers and black regions.

New method calibrates reference distributions for bounded support.

problem Lack of principled method for bounded-support statistical reference distributions.
method Formulated maximum entropy on projective space of nonnegative measures.
result Prescribed acceptance region uniquely determines deformation parameter.

The paper examines stability of ReLU networks in tangent space and activation regions.

problem Stability and sensitivity of ReLU networks to small changes.
method Tangent sensitivity measure for ReLU networks, focusing on stability induced by individual examples.
result Tangent sensitivity correlates with the distribution of activation regions and generalization gap.

The paper develops methods for constructing confidence regions for regression functions in binary classification.

problem Building distribution-free confidence regions for regression functions in binary classification.
method Resampling test and empirical risk minimization approach for model classes with finite pseudo-dimensions and inverse Lipschitz parameterizations.
result Strong uniform consistency and exponential probably approximately correct bounds on the L2L_2 sizes of the regions.