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,932 papers · 148 categories

Trend · papers per month

12243547 · May 202619922001200920172026
48 results for orthogonal array

This paper introduces an efficient method for optimizing deep learning hyperparameters.

problem The high dependency of deep learning algorithms on hyper-parameters.
method Orthogonal Array Tuning Method (OATM) for deep learning hyper-parameter tuning.
result The proposed OATM method significantly saves tuning time compared to state-of-the-art methods.

Robust STAP with coprime arrays reduces clutter using sparse modeling.

problem Limited performance due to training samples support in practical applications.
method Two-stage approach: 1) RD virtual snapshot, 2) RD sparse measurement modeling with OMP-like recovery.
result Robust to prior knowledge errors, good clutter suppression performance.

New algorithms reduce orthogonality constraint enforcement time in machine learning.

problem Efficiently solving orthogonality constraints in machine learning.
method Extending the landing algorithm to Stiefel manifold, incorporating stochastic and variance reduction techniques.
result All proposed methods achieve the same convergence rate as Riemannian counterparts enforcing constraints.

We introduce an application of the group lasso to design of experiments. Note that we are NOT trying to explain experimental design for the group lasso. Conversely, we explain how we can use the idea of the group lasso in experimental design, showing that the problem of constructing an optimal design matrix can be tran…

2013-08-06abs ↗pdf ↗

A new probabilistic BTD method for tensor data.

problem Modeling higher-order tensors with robust inference.
method Probabilistic Block-Term Decomposition using variational Bayesian inference and von-Mises Fisher distribution.
result The proposed pBTD can quantify multi-linear structures robustly.

Paper develops efficient DML estimators for multiway clustered data without cross-fitting.

problem Efficient inference in models with multiway clustered dependence.
method Neyman-orthogonal moment conditions combined with localisation-based empirical process approach.
result Valid inference achieved without cross-fitting, showing debiased GMM estimators are asymptotically linear and normal.

Improves magnetic field mapping using an array of magnetometers with noisy input.

problem Improving magnetic field maps in indoor environments with noisy magnetometer data.
method Uses Gaussian process regression with an array of magnetometers, incorporating known array positions and relative magnetometer locations.
result The method produces higher quality magnetic field maps compared to using a single magnetometer.

Paper improves DOA estimation in sparse arrays using Siamese neural networks.

problem Challenges in DOA estimation with limited snapshots in sparse linear arrays.
method Introduces a Siamese neural network with a sparse augmentation layer for enhanced signal feature embedding.
result Demonstrates improved DOA estimation accuracy in sparse arrays.

Direction of arrival (DoA) estimation of targets improves with the number of elements employed by a phased array radar antenna. Since larger arrays have high associated cost, area and computational load, there is recent interest in thinning the antenna arrays without loss of far-field DoA accuracy. In this context, a c…

2018-02-27abs ↗pdf ↗

Analog arrays are a promising upcoming hardware technology with the potential to drastically speed up deep learning. Their main advantage is that they compute matrix-vector products in constant time, irrespective of the size of the matrix. However, early convolution layers in ConvNets map very unfavorably onto analog a…

2018-07-03abs ↗pdf ↗

Novel CNN array for sign language recognition using wearable IMUs.

problem Efficiently recognizing sign language from wearable IMU signals.
method Two-dimensional Convolutional Neural Network array architecture for Indian sign language recognition.
result Peak classification accuracies of 94.20% for general sentences and 95.00% for interrogative sentences achieved.

The CHAMPION study clusters multi-dimensional accelerometer data to understand health links.

problem Clustering multi-dimensional data from pediatric longitudinal studies.
method Developed a finite mixture of multidimensional arrays model for clustering 4-dimensional accelerometer data.
result Demonstrated the feasibility and utility of clustering higher order data.

New algorithm eliminates symmetry requirement for training neural networks on resistive device arrays.

problem Training accuracy on resistive device arrays depends on device switching symmetry.
method Developed 'Tiki-Taka' algorithm to minimize unintentional cost term due to device asymmetry.
result Achieves same accuracy with non-symmetric devices as with symmetric devices.

Missing data is an important challenge when dealing with high dimensional data arranged in the form of an array. In this paper, we propose methods for estimation of the parameters of array variate normal probability model from partially observed multiway data. The methods developed here are useful for missing data impu…

2012-09-12abs ↗pdf ↗

A neural network, IHT-Net, improves DOA estimation with sparse arrays.

problem Single-snapshot DOA estimation with sparse arrays in dynamic settings.
method IHT-inspired neural network with recurrent neural network and autoencoders.
result IHT-Net achieves faster convergence and higher accuracy in DOA estimation.

We propose the Neural Logic Machine (NLM), a neural-symbolic architecture for both inductive learning and logic reasoning. NLMs exploit the power of both neural networks---as function approximators, and logic programming---as a symbolic processor for objects with properties, relations, logic connectives, and quantifier…

2019-04-26abs ↗pdf ↗

Paper proposes a learning-based sparse Bayesian method for accurate off-grid DOA estimation.

problem One-bit off-grid direction of arrival (DOA) estimation in a single snapshot scenario.
method Formulated off-grid DOA estimation model, used Sparse Bayesian framework, proposed Learning-based Sparse Bayesian approach.
result Improved computational efficiency and accuracy in off-grid DOA estimation.

This paper proposes a learning framework for n-bit quantized neural networks that improves accuracy and speed on FPGAs.

problem Efficiently implementing quantized neural networks on FPGAs to maintain accuracy and speed.
method A novel learning framework for n-bit QNNs, constrained weights, reconstructed gradient function, n-BQ-NN structure, and SVPE array.
result Quantized models achieve almost the same accuracy as full-precision models and outperform typical low-precision QNNs.

In this paper we prove the following geometric inequality in the hyperbolic space $\H^n$ (n5)n\ge 5), which is a hyperbolic Alexandrov-Fenchel inequality, \[\begin{array}{rcl} \ds \int_Σ\s_4 d μ\ge \ds\vs C_{n-1}^4ω_{n-1}\left\{\left(\frac{|Σ|}{ω_{n-1}} \right)^\frac 12 + \left(\frac{|Σ|}{ω_{n-1}} \right)^{\frac 12\frac…

2013-03-07abs ↗pdf ↗

The paper proves existence of solutions for mean field equations on compact Riemann surfaces.

problem Existence of solutions for mean field equations on compact Riemann surfaces.
method Min-max scheme introduced by Djadli-Malchiodi (2006) and Djadli (2008).
result Proves existence of solutions for mean field equations on compact Riemann surfaces.

Differentiable sorting framework using optimal transport.

problem Piecewise constant sorting function without gradient information.
method Linking sorting to optimal transport, adding entropic regularization, and approximating with Sinkhorn iterations.
result Differentiable sorting operators (S-sorts, S-CDFs, S-quantiles) for machine learning applications.

In order to cope with the increased data volumes generated by modern radio interferometers such as LOFAR (Low Frequency Array) or SKA (Square Kilometre Array), fast and efficient calibration algorithms are essential. Traditional radio interferometric calibration is performed using nonlinear optimization techniques such…

2013-03-05abs ↗pdf ↗

This paper proves a conjecture about unique positive harmonic functions in a ball.

problem Proving the uniqueness of positive harmonic functions in a unit ball for specific parameters.
method Analyzing a partial differential equation to show the solution is constant.
result Guo-Wang's conjecture is proven for the specified parameters.

Stochastic partition models tailor a product space into a number of rectangular regions such that the data within each region exhibit certain types of homogeneity. Due to constraints of partition strategy, existing models may cause unnecessary dissections in sparse regions when fitting data in dense regions. To allevia…

2016-05-23abs ↗pdf ↗

We apply the OSCAR (octagonal selection and clustering algorithms for regression) in recovering group-sparse matrices (two-dimensional---2D---arrays) from compressive measurements. We propose a 2D version of OSCAR (2OSCAR) consisting of the 1\ell_1 norm and the pair-wise \ell_{\infty} norm, which is convex but non-d…

2014-02-20abs ↗pdf ↗

Activities in reinforcement learning (RL) revolve around learning the Markov decision process (MDP) model, in particular, the following parameters: state values, V; state-action values, Q; and policy, pi. These parameters are commonly implemented as an array. Scaling up the problem means scaling up the size of the arra…

2018-07-23abs ↗pdf ↗

This paper designs sensor arrays for estimating unsteady flows efficiently.

problem Estimating high-dimensional unsteady flow fields with limited sensor placement.
method Combines data-driven modeling, Kalman Filter design, and sparsification for sensor selection.
result Proposed sensor arrays are highly effective for flow-field estimation across various conditions.

Proves existence of solutions for a specific nonlinear equation on Riemannian manifolds.

problem Existence of solutions for a doubly nonlinear evolution equation on Riemannian manifolds.
method Proves existence of weak solutions using the Leibenson equation.
result Proves the existence of a unique weak solution for any initial condition in L1(M)L(M)L^1(M) \cap L^\infty(M).

The study extends Jacobi-orthogonality to indefinite scalar product spaces.

problem Generalizing Jacobi-orthogonality to indefinite scalar product spaces.
method Comparing principles, investigating tensor relations, proving properties.
result Every quasi-Clifford tensor is Jacobi-orthogonal; certain tensors are Jacobi-dual or Osserman.

Framework for systemic risk modeling using jointly exchangeable arrays.

problem Systemic risk in insurance portfolios with interactions.
method Jointly exchangeable arrays, central limit theorems, simulation-based validation.
result Asymptotic approximations for total portfolio losses in large portfolios over long time horizons.

New Adam optimizer generalized for manifold training of neural networks.

problem Lack of clear physical intuition and difficulty in generalizing Adam optimizer to manifolds.
method Leverages the global tangent space representation of manifolds to perform Adam optimizer steps.
result Significant speed-ups in transformer training with orthogonality constraints.