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

139279418557 · Jun 202019922001200920172026
48 results for rating systems

The paper explores growth rates and Perron numbers in Coxeter systems with low-dimensional Davis complexes.

problem Investigating growth rates and specific types of numbers in Coxeter systems with Davis complexes of low dimension.
method Examining Coxeter systems with Davis complexes of dimension at most 2, focusing on growth rates and specific types of numbers.
result The growth rate of Coxeter systems with Davis complexes of dimension at most 2 are either Salem or Pisot numbers, depending on the Euler characteristic.

Bayesian rating system for large competitions improves prediction and efficiency.

problem Rating systems for large, competitive events like online programming contests.
method Developed a Bayesian rating system for many participants, proving robustness and runtime.
result The system outperforms existing systems in accuracy and computation speed.

Modern online platforms rely on effective rating systems to learn about items. We consider the optimal design of rating systems that collect binary feedback after transactions. We make three contributions. First, we formalize the performance of a rating system as the speed with which it recovers the true underlying ran…

2018-06-18abs ↗pdf ↗

The Basel II Accords have sparked increased interest in the development of approaches based on internal ratings systems and have initiated the elaboration of models for remote ratings forecasts based on external ones as part of Risk Management and Early Warning Systems. This article evaluates the peculiarities of curre…

2016-07-05abs ↗pdf ↗

New method improves reliability of recommender systems in face of fake accounts and manipulation.

problem Improving reliability of recommender systems in the presence of fake accounts and manipulation.
method Robust Discrete Matrix Completion (RDMC) method designed to handle sparse rating data and manipulation.
result Evaluations show RDMC offers a statistically-sound blueprint for future studies on recommender systems.

Study identifies and validates a method for system identification of Markov jump linear systems.

problem System identification for autonomous Markov jump linear systems with complete state observations.
method Proposes switched least squares method for identification and derives rates of convergence.
result Data-independent rate of convergence is O(log(T)/T)\mathcal{O}\big(\sqrt{\log(T)/T} \big), showing strong consistency.

Paper revisits set membership estimation for linear systems with relaxed disturbance bounds.

problem Set membership estimation for linear systems with disturbances bounded by convex sets.
method Adopted block-martingale small-ball condition and random perturbed control policies to establish convergence rates.
result Established convergence rates for disturbances bounded by general convex sets.

Study growth rates of subgroups in groups with a constricting element.

problem Understanding growth rates of subgroups in groups with a constricting element.
method Examining the spectrum of relative and quotient exponential growth rates of quasi-convex subgroups.
result Determine when growth rates of subgroups are strictly smaller or coincide with the group's growth rate.

Statistical test verifies long-term rating system calibration with overlapping time windows.

problem Verifying supervisory requirements for overlapping time windows in rating systems.
method Analyzes long-run default rate distribution and correlation effects; presents conservative calibration test methods.
result Developed a test for individual and portfolio levels that can handle unknown variance.

Study learns dynamics of linear systems from multiple short trajectories.

problem Learning dynamics of autonomous linear systems from multiple short trajectories.
method Finite sample analysis for stable and unstable systems, adjusting trajectory length for marginally stable systems.
result Learning rate of O(1N)\mathcal{O}(\frac{1}{\sqrt{N}}) for both stable and unstable systems.

Algorithm learns linear systems from partial observations with near-optimal rate.

problem Identifying linear dynamical systems from partial observations, especially those with long-term memory.
method Multi-scale low-rank approximation using SVD on Hankel matrices of increasing sizes, combined with Fourier domain concentration bounds.
result Near-optimal rate of $\widetilde O\left(\sqrt\frac{d}{T} ight)$ in H2\mathcal{H}_2 error, with logarithmic dependence on memory length.

New method solves optimization problems on manifolds using symplectic integrators.

problem Optimization tasks on manifolds with nonlinear constraints.
method Dissipative extension of Dirac's theory of constrained Hamiltonian systems and geometric/symplectic numerical integrators.
result Developed algorithms achieve optimal convergence rates locally.

The paper proposes a new recommender system combining ratings and textual reviews.

problem Lack of using textual reviews in recommender systems.
method Combines Latent Factor Model with Latent Dirichlet Allocation for textual reviews.
result Combining textual reviews with ratings improves recommendation quality.

One of the greatest challenges in the design of a real-time perception system for autonomous driving vehicles and drones is the conflicting requirement of safety (high prediction accuracy) and efficiency. Traditional approaches use a single frame rate for the entire system. Motivated by the observation that the lack of…

2018-11-24abs ↗pdf ↗

We study large deviations and rare default clustering events in a dynamic large heterogeneous portfolio of interconnected components. Defaults come as Poisson events and the default intensities of the different components in the system interact through the empirical default rate and via systematic effects that are comm…

2013-11-03abs ↗pdf ↗

We propose a simple model of the banking system incorporating a game feature where the evolution of monetary reserve is modeled as a system of coupled Feller diffusions. The Markov Nash equilibrium generated through minimizing the linear quadratic cost subject to Cox-Ingersoll-Ross type processes creates liquidity and …

2016-11-21abs ↗pdf ↗

We propose an algorithm to actively estimate the parameters of a linear dynamical system. Given complete control over the system's input, our algorithm adaptively chooses the inputs to accelerate estimation. We show a finite time bound quantifying the estimation rate our algorithm attains and prove matching upper and l…

2020-02-02abs ↗pdf ↗

Most of the existing recommender systems use the ratings provided by users on individual items. An additional source of preference information is to use the ratings that users provide on sets of items. The advantages of using preferences on sets are two-fold. First, a rating provided on a set conveys some preference in…

2019-04-22abs ↗pdf ↗

New method preserves convergence rates in gradient-based optimization.

problem How to discretize gradient-based optimization systems while preserving stability and convergence rates.
method Geometric framework for dissipative symplectic integration.
result Dissipative symplectic integrators preserve rates of convergence up to a controlled error.

Recommender systems are widely used to predict personalized preferences of goods or services using users' past activities, such as item ratings or purchase histories. If collections of such personal activities were made publicly available, they could be used to personalize a diverse range of services, including targete…

2017-06-06abs ↗pdf ↗

We investigate the dynamics of growth models in terms of dynamical system theory. We analyse some forms of knowledge and its influence on economic growth. We assume that the rate of change of knowledge depends on both the rate of change of physical and human capital. First, we study model with constant savings. The mod…

2006-08-20abs ↗pdf ↗

Decentralized learning ensures stability in online queuing systems with packet rates above 1.

problem Ensuring stability in online queuing systems with decentralized learning.
method Proposed cooperative queues and a learning algorithm for packet rates above 1.
result Decentralized learning strategies guarantee stability in queuing systems with packet rates above 1.

This paper elaborates on the validation requirements for rating systems and probabilities of default (PDs) which were introduced with the New Capital Standards (Basel II). We start in Section 2 with some introductory remarks on the topics and approaches that will be discussed later on. Then we have a view on the develo…

2006-06-07abs ↗pdf ↗

A fast method estimates correlations in hybrid systems using observable market data.

problem Estimating instantaneous correlations in hybrid systems from observable data.
method Empirical correlations between observable market quantities are used to estimate state variables' correlations. Linear systems are involved, and the matrix is converted to positive semidefinite if necessary.
result The estimates are reasonably accurate, especially with more than 1,000 data points.

A new method for multi-criteria recommender systems using graph attention networks.

problem Lack of nuanced relationships between users and items based on specific criteria.
method MDGAT, a multi-edge bipartite graph with dual attention networks and contrastive learning.
result MDGAT achieves higher accuracy in predicting item ratings compared to baseline methods.

This study investigates the use of reinforcement learning to guide a general purpose cache manager decisions. Cache managers directly impact the overall performance of computer systems. They govern decisions about which objects should be cached, the duration they should be cached for, and decides on which objects to ev…

2019-09-30abs ↗pdf ↗

Estimates yearly improvement rates for nearly all technologies using US patent data.

problem Providing a comprehensive account of technological change rates.
method Mapping patents to technology domains, calculating average centrality, and estimating improvement rates.
result Variation in improvement rates from 1.9% to 228.8% per year, with software-based domains often the fastest.

Identifies bilinear systems from a single trajectory with optimal sample complexity.

problem Learning bilinear systems from a single trajectory of states and inputs.
method Uses a mild marginal mean-square stability assumption and martingale small-ball condition.
result Sample complexity and statistical error rates are optimal.

The two main tasks in the Recommender Systems domain are the ranking and rating prediction tasks. The rating prediction task aims at predicting to what extent a user would like any given item, which would enable to recommend the items with the highest predicted scores. The ranking task on the other hand directly aims a…

2018-07-31abs ↗pdf ↗

Unified framework for solving linear systems with improved convergence rates.

problem Efficiently solving linear systems with randomized batch-sampling methods.
method Developed a unified randomized batch-sampling Kaczmarz framework with concentration inequalities for analysis.
result Derived new expected linear convergence rate bounds that are tighter and more reflective of empirical behavior.

Algorithm stabilizes queues in asymmetric systems with unknown service rates.

problem Stabilizing queues in multi-class multi-server systems with unknown service rates.
method Proposes UCB and Thompson Sampling algorithms to stabilize queues while learning service rates.
result Achieves system stability with an average queue length bound of \(O(\min\{N,K\}/ε)\) for large time horizon \(T\).

Wireless communication systems operate in complex time-varying environments. Therefore, selecting the optimal configuration parameters in these systems is a challenging problem. For wireless links, \emph{rate selection} is used to select the optimal data transmission rate that maximizes the link throughput subject to a…

2019-02-28abs ↗pdf ↗

The paper tackles long-context linear system identification with improved sample complexity bounds.

problem Identifying dynamical systems with long dependencies over fixed context windows.
method Established sample complexity bounds for systems with linear dependencies over a context window of length p.
result The learning process is not hindered by slow mixing properties in extended context windows.

Deviation-based learning improves recommender systems by abstaining from recommending choices users might follow.

problem Recommender systems learn from user choices but can stall if users blindly follow recommendations.
method The recommender learns user knowledge by observing choices, abstaining from recommending a choice when multiple alternatives produce similar payoffs.
result Learning rate and social welfare improve when the recommender abstains from recommending certain choices.

We consider a system of diffusion processes that interact through their empirical mean and have a stabilizing force acting on each of them, corresponding to a bistable potential. There are three parameters that characterize the system: the strength of the intrinsic stabilization, the strength of the external random per…

2012-04-16abs ↗pdf ↗