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

Trend · papers per month

88176263351 · Jun 202019922001200920172026
48 results for scale handling

New normalizing flows for sphere distributions improve complexity and scale handling.

problem No straightforward normalizing flows for Fisher-Bingham distributions in higher dimensions.
method Zoom-linear-project (ZLP)-Fisher flows that gradually add complexity and handle varying scales.
result Generalizes Fisher-Bingham distributions to normalizing flows in any dimension.

BanditLP optimizes personalized recommendations for large-scale systems.

problem Optimizing personalized recommendations for large-scale systems with constraints.
method Unified neural Thompson Sampling for learning and large-scale linear programming for action selection.
result Consistent gains over strong baselines in experiments and business win in LinkedIn's email marketing system.

The effectiveness of Convolutional Neural Networks (CNNs) has been substantially attributed to their built-in property of translation equivariance. However, CNNs do not have embedded mechanisms to handle other types of transformations. In this work, we pay attention to scale changes, which regularly appear in various t…

2019-10-14abs ↗pdf ↗

Combines pseudo-point and state space approximations for scalable GPs.

problem Handling large numbers of off-the-grid spatial data-points and long time-series.
method Combines pseudo-point approximations for spatial data with state space GP approximations for temporal data.
result Combined approach is more scalable and applicable to a greater range of spatio-temporal problems.

Recent advancements in recurrent neural network (RNN) research have demonstrated the superiority of utilizing multiscale structures in learning temporal representations of time series. Currently, most of multiscale RNNs use fixed scales, which do not comply with the nature of dynamical temporal patterns among sequences…

2019-02-15abs ↗pdf ↗

Recurrent Neural Networks (RNN), Long Short-Term Memory Networks (LSTM), and Memory Networks which contain memory are popularly used to learn patterns in sequential data. Sequential data has long sequences that hold relationships. RNN can handle long sequences but suffers from the vanishing and exploding gradient probl…

2019-04-18abs ↗pdf ↗

Develops deep jump learning for continuous treatment OPE.

problem Estimating mean outcomes under new treatment rules using historical data from different rules.
method Adaptive deep discretization of continuous treatment space using deep learning and multi-scale change point detection.
result Validated method through theoretical results, simulations, and real application to Warfarin Dosing.

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.

HGT models heterogeneous graphs with dedicated node and edge representations.

problem Infeasibility of existing GNNs for heterogeneous graphs.
method Node- and edge-type dependent parameters, relative temporal encoding, heterogeneous mini-batch graph sampling.
result HGT outperforms state-of-the-art GNNs by 9%--21% on various downstream tasks.

Framework handles both exchangeable and non-exchangeable event sequences without tuning.

problem Handling both exchangeable and non-exchangeable event sequences efficiently.
method Parametric Hawkes-process-inspired conditional probability mass function with variational inference.
result Competitive computational and predictive performance against state-of-the-art methods.

We consider large-scale Markov decision processes (MDPs) with parameter uncertainty, under the robust MDP paradigm. Previous studies showed that robust MDPs, based on a minimax approach to handle uncertainty, can be solved using dynamic programming for small to medium sized problems. However, due to the "curse of dimen…

2013-06-26abs ↗pdf ↗

Bayesian Tensor Ring factorization improved for scalability and handling of discrete data.

problem Scalability issues and handling of discrete data in Bayesian Tensor Ring factorization.
method Proposes a novel Bayesian Tensor Ring model with a nonparametric Multiplicative Gamma Process prior and Pólya-Gamma augmentation for discrete data. Developed efficient Gibbs sampler and online EM algorithm for scalability.
result Significantly improved scalability and handling of discrete data compared to previous methods.

The article proposes modified Gower's coefficients for handling mixed type variables in nearest neighbor methods.

problem Handling mixed type variables in nearest neighbor methods, especially imputation and statistical matching.
method Suggests modifications to the Gower's distance for interval and ratio scaled variables to address unbalanced contributions and outlier sensitivity.
result Improved distance calculations reduce the unbalanced contribution of different variable types and attenuate outlier effects.

PLOT uses optimal transport to find neural site handles for causal abstraction.

problem Finding the relevant neural site for causal analysis is computationally challenging.
method PLOT employs optimal transport to localize causal variables from neural network outputs.
result PLOT efficiently finds intervention handles for causal abstraction in neural networks.

This paper tackles hyperparameter tuning for large-scale kernel ridge regression.

problem Hyperparameter tuning is crucial but often left to users, hindering efficiency and usability.
method Proposes a complexity regularization criterion based on a data-dependent penalty for efficient optimization.
result Demonstrates the benefit of the proposed approach through extensive empirical evaluation.

Deep neural networks have enabled progress in a wide variety of applications. Growing the size of the neural network typically results in improved accuracy. As model sizes grow, the memory and compute requirements for training these models also increases. We introduce a technique to train deep neural networks using hal…

2017-10-10abs ↗pdf ↗

Recurrent Neural Networks (RNNs) are designed to handle sequential data but suffer from vanishing or exploding gradients. Recent work on Unitary Recurrent Neural Networks (uRNNs) have been used to address this issue and in some cases, exceed the capabilities of Long Short-Term Memory networks (LSTMs). We propose a simp…

2017-07-29abs ↗pdf ↗

Large-scale generalized linear array models (GLAMs) can be challenging to fit. Computation and storage of its tensor product design matrix can be impossible due to time and memory constraints, and previously considered design matrix free algorithms do not scale well with the dimension of the parameter vector. A new des…

2015-10-12abs ↗pdf ↗

To scale Gaussian processes (GPs) to large data sets we introduce the robust Bayesian Committee Machine (rBCM), a practical and scalable product-of-experts model for large-scale distributed GP regression. Unlike state-of-the-art sparse GP approximations, the rBCM is conceptually simple and does not rely on inducing or …

2015-02-10abs ↗pdf ↗

In this paper, we present a real-world conversational AI system to search for and book hotels through text messaging. Our architecture consists of a frame-based dialogue management system, which calls machine learning models for intent classification, named entity recognition, and information retrieval subtasks. Our ch…

2019-08-27abs ↗pdf ↗

Query2box embeds complex queries as boxes to handle logical operations in large KGs.

problem Handling complex logical queries on large-scale incomplete knowledge graphs.
method Embed KG entities and queries into a vector space as boxes, handling conjunctions as intersections and disjunctions through Disjunctive Normal Form.
result Query2box achieves up to 25% relative improvement over state-of-the-art methods.

We present a framework for clustering with cluster-specific feature selection. The framework, CRAFT, is derived from asymptotic log posterior formulations of nonparametric MAP-based clustering models. CRAFT handles assorted data, i.e., both numeric and categorical data, and the underlying objective functions are intuit…

2015-06-25abs ↗pdf ↗

Paper develops a new method to improve model calibration under distribution shifts.

problem Challenges in uncertainty quantification with different training and test distributions.
method Develops multi-domain temperature scaling to handle distribution shifts.
result Outperforms existing methods on in-distribution and out-of-distribution test sets.

Much recent work has concerned sparse approximations to speed up the Gaussian process regression from the unfavorable O(n3) scaling in computational time to O(nm2). Thus far, work has concentrated on models with one covariance function. However, in many practical situations additive models with multiple covariance func…

2012-06-13abs ↗pdf ↗

Deep neural networks provide meaningful uncertainty estimates for large-scale simulations.

problem Uncertainty estimates for deep neural network predictions from large-scale simulations.
method General variational inference approach to calibrate Bayesian uncertainties.
result Calibrated Bayesian uncertainties preserved physics-correlations in predicted quantities.

Correlated topic modeling has been limited to small model and problem sizes due to their high computational cost and poor scaling. In this paper, we propose a new model which learns compact topic embeddings and captures topic correlations through the closeness between the topic vectors. Our method enables efficient inf…

2017-07-01abs ↗pdf ↗

While state-of-the-art kernels for graphs with discrete labels scale well to graphs with thousands of nodes, the few existing kernels for graphs with continuous attributes, unfortunately, do not scale well. To overcome this limitation, we present hash graph kernels, a general framework to derive kernels for graphs with…

2016-10-01abs ↗pdf ↗

Develops a new method for neural network significance testing without strict constraints.

problem Testing neural networks without bounded weights or specific architectural constraints.
method Uses Rademacher complexity bounds, weakened Sobolev space membership conditions, and a modified sieve space construction.
result Achieves optimal convergence rates and valid asymptotic distributions for test statistics.

Paper introduces robust kernel ridge regression using Cauchy loss for handling various noise types.

problem Developing robust regression methods for noisy data.
method Introduces kernel Cauchy ridge regressor (KCRR) using Cauchy loss function.
result Establishes almost minimax-optimal convergence rate for KCRR in terms of L2L_2-risk.

Scalable and robust TR decomposition for large-scale data with missing entries and outliers.

problem Handling large-scale tensor data with missing entries and outliers.
method Auto-weighted steepest descent method for missing entries and outliers identification, FGMC and RStS strategies.
result Outperforms existing TR decomposition methods in the presence of outliers and runs faster than robust tensor completion algorithms.

Graph Convolutional Networks (GCNs) have recently been shown to be quite successful in modeling graph-structured data. However, the primary focus has been on handling simple undirected graphs. Multi-relational graphs are a more general and prevalent form of graphs where each edge has a label and direction associated wi…

2019-11-08abs ↗pdf ↗