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

102204305407 · Jun 202019922001200920172026
48 results for Linear Regions

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 ↗

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.

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.

It is well-known that the expressivity of a neural network depends on its architecture, with deeper networks expressing more complex functions. In the case of networks that compute piecewise linear functions, such as those with ReLU activation, the number of distinct linear regions is a natural measure of expressivity.…

2019-01-25abs ↗pdf ↗

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.

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 ↗

Study on the complexity of 1D ReLU neural networks, proving growth in linear regions.

problem Understanding the complexity and expressivity of 1D ReLU neural networks.
method Analyzing the number of linear regions in randomly initialized, fully connected 1D ReLU networks in the infinite-width limit.
result The expected number of linear regions grows as a function of the number of neurons in each layer.

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.

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.

Introduces CCR for constructing confidence regions from conformal predictions.

problem Challenges in constructing confidence regions for model parameters.
method Combines conformal prediction intervals for model outputs to establish confidence regions for parameters under minimal assumptions.
result Valid coverage guarantees for finite sample regime, applicable to various model types.

A new complexity measure for neural networks improves upon classical methods.

problem Lack of a refined complexity measure for comparing different neural network architectures, especially permutation-invariant ones.
method Introduced an equivalence relation among linear functions and counted them relative to this relation.
result The new complexity measure clearly distinguishes between different models and increases exponentially with depth.

A new method, Residual-Permuted Sums, improves confidence region construction for linear regression models.

problem Constructing reliable confidence regions for linear regression models with non-symmetric noise.
method Residual-Permuted Sums (RPS) method, which permutes residuals instead of perturbing their signs.
result RPS provides exact finite sample coverage probabilities and is uniformly strongly consistent.

fMRI semantic category understanding using linguistic encoding models attempt to learn a forward mapping that relates stimuli to the corresponding brain activation. Classical encoding models use linear multi-variate methods to predict the brain activation (all voxels) given the stimulus. However, these methods essentia…

2018-11-26abs ↗pdf ↗

Deep networks realize complex mappings that are often understood by their locally linear behavior at or around points of interest. For example, we use the derivative of the mapping with respect to its inputs for sensitivity analysis, or to explain (obtain coordinate relevance for) a prediction. One key challenge is tha…

2019-07-07abs ↗pdf ↗

This work aims to study the Portuguese regional agglomeration process, using the linear form the New Economic Geography models that emphasize the importance of spatial factors (distance, costs of transport and communication) in explaining of the concentration of economic activity in certain locations. In a theoretical …

2011-10-25abs ↗pdf ↗

There are few papers about the consumption pattern of the Portuguese wine, using econometrics techniques. This work, pretend to analyze the consumers behavior of the wine produced in Portugal, determining the demand equation with panel data methods. There were used statistical data available in the Alentejo Regional Wi…

2012-12-28abs ↗pdf ↗

To help understand the underlying mechanisms of neural networks (NNs), several groups have, in recent years, studied the number of linear regions \ell of piecewise linear functions generated by deep neural networks (DNN). In particular, they showed that \ell can grow exponentially with the number of network paramet…

2019-05-27abs ↗pdf ↗

We conjecture explicit evolution formulas for Khovanov polynomials for pretzel knots in some regions in the windings space. Our description is exhaustive for genera 1 and 2. As previously observed, evolution at T != -1 is not fully smooth: it switches abruptly at the boundaries between different regions. We reveal that…

2019-04-23abs ↗pdf ↗

We consider deep feedforward neural networks with rectified linear units from a signal processing perspective. In this view, such representations mark the transition from using a single (data-driven) linear representation to utilizing a large collection of affine linear representations tailored to particular regions of…

2019-03-29abs ↗pdf ↗

In this paper, a regional knot invariant is constructed. Like the Wirtinger presentation of a knot group, each planar region contributes a generator, and each crossing contributes a relation. The invariant is call a tridle of the link. As in the quandle theory, one can define Alexander quandle and get Alexander polynom…

2017-03-17abs ↗pdf ↗

We investigate the properties of multidimensional probability distributions in the context of latent space prior distributions of implicit generative models. Our work revolves around the phenomena arising while decoding linear interpolations between two random latent vectors -- regions of latent space in close proximit…

2018-06-05abs ↗pdf ↗

We reconsider the problem of optimal trading in the presence of linear and quadratic costs, for arbitrary linear costs but in the limit where quadratic costs are small. Using matched asymptotic expansion techniques, we find that the trading speed vanishes inside a band that is narrower than in the absence of quadratic …

2015-11-23abs ↗pdf ↗

Construction of tight confidence regions and intervals is central to statistical inference and decision making. This paper develops new theory showing minimum average volume confidence regions for categorical data. More precisely, consider an empirical distribution p^\widehat{\boldsymbol{p}} generated from nn iid real…

2020-02-03abs ↗pdf ↗

New GP model estimates piecewise continuous functions.

problem Piecewise continuous regression functions in scientific and engineering applications.
method Local Gaussian process model with partitioned local data and joint estimation of boundaries.
result Superior performance over conventional GP models in estimating piecewise regression functions.

Scalable method for regionalizing and extracting temporal patterns from time series data.

problem Static spatial snapshots and ad hoc regularization limit effective spatial analysis and resource management.
method Minimum description length principle for fully nonparametric spatial partitioning and time series archetypes.
result Accurately recovers planted regional structure and drivers in synthetic and empirical data.

A new method detects interactions in machine learning models.

problem Interpreting non-linear and interaction effects in machine learning models.
method Regional effect plots with implicit interaction detection.
result The method quantifies and interprets feature effects reliably, less confounded by interactions.

Previous work has questioned the conditions under which the decision regions of a neural network are connected and further showed the implications of the corresponding theory to the problem of adversarial manipulation of classifiers. It has been proven that for a class of activation functions including leaky ReLU, neur…

2019-01-25abs ↗pdf ↗

The location-based social network, Foursquare, reflects the human activities of a city. The mobility dynamics inferred from Foursquare helps us understanding urban social events like crime In this paper, we propose a directed graph from the aggregated movement between regions using Foursquare data. We derive region ris…

2019-07-25abs ↗pdf ↗

New insights into how neural networks classify data.

problem Understanding the topological structure of decision regions in ReLU networks.
method Defining generic and transversal ReLU networks, and using linear complexes to identify obstructions.
result Generic, transversal ReLU networks have at most one bounded connected component in their decision regions.

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.

We present a new, unifying approach following some recent developments on the complexity of neural networks with piecewise linear activations. We treat neural network layers with piecewise linear activations as tropical polynomials, which generalize polynomials in the so-called (max,+)(\max, +) or tropical algebra, with pos…

2018-05-22abs ↗pdf ↗

We study algebraic varieties of ReLU networks to understand their representable functions.

problem Understanding the functions that ReLU neural networks can represent.
method We introduce algebraic varieties associated with ReLU networks and derive polynomial equations to characterize representable functions.
result Conditions under which ReLU networks attain their expected dimension, providing insight into their structural properties.

In exchange for large quantities of data and processing power, deep neural networks have yielded models that provide state of the art predication capabilities in many fields. However, a lack of strong guarantees on their behaviour have raised concerns over their use in safety-critical applications. A first step to unde…

2019-10-09abs ↗pdf ↗