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

6351,2711,9062,541 · Jun 202019922001200920172026
48 results for location and scale differences

Improved average distance classifier for HDLSS settings with multiple population differences.

problem Poor performance of average distance classifier in HDLSS settings with location and scale differences.
method Proposed transformations to the average distance classifier to handle multiple population differences.
result The proposed classifiers perform well even when populations differ in other aspects than location and scale.

Exact 1-Wasserstein distance between location-scale distributions derived, with privacy effects studied.

problem Calculating the 1-Wasserstein distance between location-scale distributions and its impact on differential privacy.
method Exact expressions and special functions for 1-Wasserstein distance, new upper bounds, and asymptotic analysis.
result New linear upper bound and detailed asymptotic bounds for Gaussian case, effect of differential privacy studied.

In this paper, we propose hybrid building/floor classification and floor-level two-dimensional location coordinates regression using a single-input and multi-output (SIMO) deep neural network (DNN) for large-scale indoor localization based on Wi-Fi fingerprinting. The proposed scheme exploits the different nature of th…

2018-10-13abs ↗pdf ↗

Study shows one-dimensional location-scale-shape models are flat in Wasserstein geometry.

problem Investigating curvature in location-scale-shape models under Wasserstein metric.
method Introduced location-scale-shape model and investigated its geometry.
result Location-scale-shape model is intrinsically flat but extrinsically curved in Wasserstein geometry.

Space2Vec learns multi-scale spatial representations from grid cell insights.

problem Encoding spatial features with varying scales from GIS data.
method Proposes Space2Vec, a multi-scale representation learning model using grid cell insights.
result Space2Vec outperforms baselines in predicting POI types and image classification with geo-locations.

This paper argues that a class of Riemannian metrics, called warped metrics, plays a fundamental role in statistical problems involving location-scale models. The paper reports three new results : i) the Rao-Fisher metric of any location-scale model is a warped metric, provided that this model satisfies a natural invar…

2017-02-23abs ↗pdf ↗

Paper analyzes VI for location-scale families, proving robustness guarantees for mean and correlation recovery.

problem Misspecification in VI for intractable target densities.
method Variational inference on location-scale families with symmetries.
result VI recovers mean and correlation matrix under specific symmetries.

Deep networks adapt to function regularity and data distribution.

problem Understanding deep learning's adaptability to function regularity and data distribution.
method Developed nonparametric approximation and estimation theories for a broad class of functions using deep ReLU networks.
result Deep neural networks are adaptive to different regularity of functions and nonuniform data distributions.

Differentially private log-location-scale regression models improve privacy in statistical analysis.

problem Ensuring privacy in statistical regression models while maintaining accuracy.
method Integrates differential privacy into LLS regression using the functional mechanism.
result Proposed DP-LLS models satisfy ε-differential privacy and perform well under various conditions.

ELU algorithm improves on EM for over-specified Gaussian mixtures.

problem Slow convergence of EM in over-specified Gaussian mixtures.
method Developed ELU algorithm for two-component mixtures, combining exponential location update and gradient descent.
result ELU converges to final statistical radius after logarithmic iterations, resolving open question.

Paper proposes a k-NN classifier for detecting spike-and-wave seizures in EEG.

problem Early detection of epileptic seizures in EEG signals.
method Uses t-location-scale distribution and k-nearest neighbors classifier.
result Demonstrates improved classification accuracy, sensitivity, and specificity on real data.

Many large-scale machine learning (ML) applications need to perform decentralized learning over datasets generated at different devices and locations. Such datasets pose a significant challenge to decentralized learning because their different contexts result in significant data distribution skew across devices/locatio…

2019-10-01abs ↗pdf ↗

Behaviors of several laboratory animals can be modeled as sequences of stereotyped behaviors, or behavioral motifs. However, identifying such motifs is a challenging problem. Behaviors have a multi-scale structure: the animal can be simultaneously performing a small-scale motif and a large-scale one (e.g. \textit{chewi…

2017-07-11abs ↗pdf ↗

We introduce a wavelet-domain functional analysis of variance (fANOVA) method based on a Bayesian hierarchical model. The factor effects are modeled through a spike-and-slab mixture at each location-scale combination along with a normal-inverse-Gamma (NIG) conjugate setup for the coefficients and errors. A graphical mo…

2016-02-12abs ↗pdf ↗

A new framework uses multi-agent reinforcement learning for evaluating policies in two-sided markets.

problem Evaluating the effects of different policies in two-sided markets with spatial and temporal interference.
method Introduces a multi-agent reinforcement learning (MARL) framework to address policy evaluation challenges in large-scale fleet management.
result Proposes novel estimators for mean outcomes under different products that are consistent despite high-dimensionality.

In the brain, learning signals change over time and synaptic location, and are applied based on the learning history at the synapse, in the complex process of neuromodulation. Learning in artificial neural networks, on the other hand, is shaped by hyper-parameters set before learning starts, which remain static through…

2018-12-05abs ↗pdf ↗

We study a class of weakly identifiable location-scale mixture models for which the maximum likelihood estimates based on nn i.i.d. samples are known to have lower accuracy than the classical n12n^{- \frac{1}{2}} error. We investigate whether the Expectation-Maximization (EM) algorithm also converges slowly for these m…

2019-02-01abs ↗pdf ↗

Meta-SAGE improves deep RL scalability for CO tasks by adapting pre-trained models to larger-scale problems.

problem Improving scalability of deep reinforcement learning models for combinatorial optimization tasks.
method Meta-SAGE combines a scale meta-learner and scheduled adaptation with guided exploration to adjust model parameters for larger-scale problems.
result Meta-SAGE outperforms previous methods and significantly improves scalability in CO tasks.

NAMLSS models provide interpretable neural regression for location, scale, and shape.

problem Lack of interpretability in deep learning models for complex data distributions.
method Combines classical statistical methods with DNNs for distributional regression.
result Achieves visual interpretability and predictive power of deep learning models.

Guarantees convergence for black-box variational inference without modifications.

problem Convergence guarantees for black-box variational inference.
method Analysis of log-smooth posterior densities, location-scale variational family, and convergence rates of algorithm design choices.
result Proximal stochastic gradient descent fixes suboptimal convergence rates and achieves strongest known guarantees.

Multidimensional data have become ubiquitous and are frequently encountered in situations where the information is aggregated over multiple data atoms. The aggregation can be over time or other features, such as geographical location. We often have access to multiple aggregated views of the same data, each aggregated i…

2019-10-26abs ↗pdf ↗

A new TwinGP framework for efficient large-scale GP modeling.

problem Efficiently modeling large-scale Gaussian processes with computational constraints.
method Combines global and local approximations using a subset-of-data approach.
result TwinGP framework performs on par or better than state-of-the-art methods at a fraction of the computational cost.

This paper tackles denoising of complex measures using optimal transport and curvature analysis.

problem Denoising of complex, possibly non-log-concave measures.
method Score function and optimal transport theory to revert Langevin diffusion chains.
result The difficulty of denoising depends on the curvature complexity of the initial measure at specific SNR scales.

Mirror flow in shallow neural networks shows similar implicit bias to gradient flow, with key differences in curvature penalties.

problem Analyzing implicit bias in shallow neural networks with mirror flow.
method Characterization through variational problems and scaled potentials.
result Mirror flow with scaled potentials induces a rich class of biases not captured by RKHS norms.

Proposes a feature transformation for spatio-temporal traffic models to improve performance and transferability.

problem Limited transferability of deep learning models for traffic flow prediction across different locations.
method Integrates Newell's traffic flow estimators to capture broader dynamics and incorporates spatial dependencies.
result Improves model performance in predicting traffic flows over different horizons.

Optimizes black-box functions with varying costs across multiple sources.

problem Optimizing black-box functions with varying costs across multiple sources.
method Uses Augmented Gaussian Process and Gaussian Process to model fidelity and location-dependent costs, respectively. Uses Confidence Bound acquisition function to select sources and locations.
result The approach significantly outperforms existing methods on Hyperparameters Optimization tasks.

Interpretable ML models predict recidivism as well as non-interpretable methods and are more fair.

problem Improving recidivism prediction models for fairness and interpretability.
method Trained interpretable ML models on two recidivism datasets, compared to existing methods, and analyzed fairness.
result Interpretable ML models can predict recidivism as well as non-interpretable methods and are more fair.

Unified framework detects shifts in climate boundaries using GP regression and MAD test.

problem Challenges in quantifying and testing for temporal shifts in spatial boundaries from noisy data.
method Combines heteroskedastic GP regression with scaled MAD GET.
result No significant decade-scale changes in arid and semi-arid interfaces, but localized shifts during extreme droughts identified.

The paper develops a neural network-based method for detecting change points in large-scale time-evolving data.

problem Detecting and locating change points in multivariate time-evolving data.
method Two-step procedure involving neural network training and test error function calibration over moving windows.
result Consistent estimates for the number and locations of change points under temporal dependence.

Study uniform rates for estimating Gaussian mixtures without separation assumption.

problem Estimating parameters in two-component Gaussian mixtures without separation.
method Uniform convergence rates derived using minimax lower bounds and careful analysis of polynomial equalities.
result Phase transition in optimal estimation rate based on mixture balance.