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

8.7%17.4%26.0%34.7% · Jun 202019922001200920172026
48 results for Unitization Algorithm

Most of the parameters in large vocabulary models are used in embedding layer to map categorical features to vectors and in softmax layer for classification weights. This is a bottle-neck in memory constraint on-device training applications like federated learning and on-device inference applications like automatic spe…

2018-11-20abs ↗pdf ↗

Randomly chosen primary hidden units and derived secondary units reduce neural network complexity.

problem Large number of hidden units in neural networks.
method Introducing primary and secondary hidden units with random weights for primary units and derived weights for secondary units.
result Significant reduction in the number of hidden units without compromising accuracy.

Algorithm learns two-layer residual units using ReLU activations from samples.

problem Learning two-layer residual units from samples.
method Design layer-wise objectives as functionals, formulate ERM as QP, solve using LP, prove statistical consistency.
result Strong statistical consistency and robustness of the algorithm.

We present a novel neural network algorithm, the Tensor Switching (TS) network, which generalizes the Rectified Linear Unit (ReLU) nonlinearity to tensor-valued hidden units. The TS network copies its entire input vector to different locations in an expanded representation, with the location determined by its hidden un…

2016-10-31abs ↗pdf ↗

Investment tool predicts higher returns for Madrid real estate units.

problem Determining which real estate units have higher returns to investment in Madrid.
method Data collection from Idealista.com, descriptive statistics, return index, machine learning algorithms.
result Introduction of machine learning algorithms for rental real estate price prediction.

A fast ML method solves complex combinatorial auction problems.

problem Solving winner determination in multi-unit combinatorial auctions.
method Graph Neural Network (GNN) with half-convolution operations for bid-item graph modeling.
result Approaches optimal performance with negligible revenue loss and low complexity.

A new method for optimizing regression problems with ReLU units converges.

problem Optimizing regression problems involving ReLU units in large language models.
method Introduced a greedy algorithm based on approximate Newton method, proving convergence in terms of the distance to optimal solution.
result The method converges in the sense of the distance to optimal solution under certain assumptions.

The paper develops a multi-unit soft sensing model for virtual flow meters that improves few-shot learning.

problem Improving soft sensor performance for new wells with limited data.
method Formulates a probabilistic, hierarchical model using a deep neural network for multi-unit soft sensing.
result Multi-unit models trained on many wells can perform well on new wells with just a few data points.

This paper analyzes and improves the effectiveness of BN techniques in controlling Internal Covariate Shift.

problem The effectiveness of BN techniques in reducing Internal Covariate Shift (ICS) is limited, especially for high-dimensional outputs and noise.
method The paper introduces a measure for ICS using the Earth Mover (EM) distance, derives bounds for this measure, and proposes a unitization algorithm to further bound ICS.
result The unitization algorithm effectively bounds ICS, especially for low-dimensional outputs and small noise, and can be tuned to control ICS.

New framework for estimating treatment effects in experiments with network interference.

problem Network interference biases traditional treatment effect estimations in randomized experiments.
method Causal message-passing framework based on high-dimensional approximate message passing.
result Practical algorithm to estimate total treatment effect in multi-period experiments.

The spectral kk-support norm enjoys good estimation properties in low rank matrix learning problems, empirically outperforming the trace norm. Its unit ball is the convex hull of rank kk matrices with unit Frobenius norm. In this paper we generalize the norm to the spectral (k,p)(k,p)-support norm, whose additional para…

2016-01-04abs ↗pdf ↗

Deep neural network learning can be formulated as a non-convex optimization problem. Existing optimization algorithms, e.g., Adam, can learn the models fast, but may get stuck in local optima easily. In this paper, we introduce a novel optimization algorithm, namely GADAM (Genetic-Evolutionary Adam). GADAM learns deep …

2018-05-19abs ↗pdf ↗

We aim to create the highest possible quality of treatment-control matches for categorical data in the potential outcomes framework. Matching methods are heavily used in the social sciences due to their interpretability, but most matching methods do not pass basic sanity checks: they fail when irrelevant variables are …

2018-06-18abs ↗pdf ↗

New algorithm speeds up fitting GLLVMs to large datasets.

problem Efficiently fitting GLLVMs to large datasets with thousands of observations.
method Approximate model using penalized quasi-likelihood, then use Newton method and Fisher scoring.
result Significantly faster and more stable than previous methods, enabling fits to larger matrices.

We investigate the problem of factorizing a matrix into several sparse matrices and propose an algorithm for this under randomness and sparsity assumptions. This problem can be viewed as a simplification of the deep learning problem where finding a factorization corresponds to finding edges in different layers and valu…

2013-11-13abs ↗pdf ↗

We give the first dimension-efficient algorithms for learning Rectified Linear Units (ReLUs), which are functions of the form xmax(0,wx)\mathbf{x} \mapsto \max(0, \mathbf{w} \cdot \mathbf{x}) with wSn1\mathbf{w} \in \mathbb{S}^{n-1}. Our algorithm works in the challenging Reliable Agnostic learning model of Kalai, Kanade, and Ma…

2016-11-30abs ↗pdf ↗

Many natural systems, such as neurons firing in the brain or basketball teams traversing a court, give rise to time series data with complex, nonlinear dynamics. We can gain insight into these systems by decomposing the data into segments that are each explained by simpler dynamic units. Building on switching linear dy…

2016-10-26abs ↗pdf ↗

In this work, we propose an infinite restricted Boltzmann machine~(RBM), whose maximum likelihood estimation~(MLE) corresponds to a constrained convex optimization. We consider the Frank-Wolfe algorithm to solve the program, which provides a sparse solution that can be interpreted as inserting a hidden unit at each ite…

2017-10-15abs ↗pdf ↗

There is growing interest in applying machine learning methods to Electronic Medical Records (EMR). Across different institutions, however, EMR quality can vary widely. This work investigated the impact of this disparity on the performance of three advanced machine learning algorithms: logistic regression, multilayer p…

2017-03-23abs ↗pdf ↗

Permutation of any two hidden units yields invariant properties in typical deep generative neural networks. This permutation symmetry plays an important role in understanding the computation performance of a broad class of neural networks with two or more hidden units. However, a theoretical study of the permutation sy…

2019-04-30abs ↗pdf ↗

METASET selects diverse unit cells for efficient data-driven metamaterial design.

problem Imbalanced datasets in unit cells can bias data-driven metamaterial design.
method METASET uses similarity metrics and DPPs to select diverse subsets of unit cells.
result Smaller, diverse subsets improve search process and structural performance.

The bienergy of smooth maps between Riemannian manifolds, when restricted to unit vector fields, yields two different variational problems depending on whether one takes the full functional or just the vertical contribution. Their critical points, called biharmonic unit vector fields and biharmonic unit sections, form …

2018-04-30abs ↗pdf ↗

New algorithm reveals piecewise affine structure of neural networks.

problem Lack of strong guarantees on deep neural networks' behavior in safety-critical applications.
method Developed a novel algorithm to compute the piecewise affine form of neural networks.
result Computed piecewise affine representations of neural networks with rectified linear unit activations.

New term ADS describes how machine learning can change user behavior.

problem Machine learning systems can unintentionally change user behavior, affecting performance.
method Introduced `unit tests` and mitigation strategy for hidden incentives in auto-induced distributional shift.
result Meta-learning and Q-learning sometimes fail unit tests but pass with mitigation strategy.

We give a polynomial-time algorithm for learning neural networks with one layer of sigmoids feeding into any Lipschitz, monotone activation function (e.g., sigmoid or ReLU). We make no assumptions on the structure of the network, and the algorithm succeeds with respect to {\em any} distribution on the unit ball in nn

2017-09-18abs ↗pdf ↗

The paper examines A/B tests in recommendation systems to detect biased algorithm comparisons due to shared data.

problem Bias in comparing recommendation algorithms due to shared data.
method Formalized as a multi-armed bandit problem, analyzed the sign of difference-in-means estimator vs true GTE.
result Data sharing can lead to biased comparisons of recommendation algorithms, and a detection procedure is proposed.

This paper tackles federated learning for automatic latent variable selection in multi-output Gaussian processes.

problem Challenges in determining the adequate number of latent processes and relying on centralized learning for privacy and computational issues.
method Proposes a hierarchical model with spike-and-slab priors for automatic latent process selection and variational inference-based federated learning algorithm.
result Demonstrates the advantageous features of the proposed federated approach through simulations and real-world data.

In this paper we propose and investigate a novel nonlinear unit, called LpL_p unit, for deep neural networks. The proposed LpL_p unit receives signals from several projections of a subset of units in the layer below and computes a normalized LpL_p norm. We notice two interesting interpretations of the LpL_p unit. First…

2013-11-07abs ↗pdf ↗

A new CNN-based algorithm improves Fourier ptychography for faster, more robust image reconstruction.

problem Slow and inefficient Fourier ptychography reconstruction under system aberrations.
method A CNN-based iterative phase retrieval algorithm trained on GPUs.
result Significantly faster and more robust image reconstruction under system aberrations.