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

128257385513 · Jun 202019922001200920172026
48 results for spectral scaled Student prior

PAC-Bayesian matrix completion with a spectral scaled Student prior offers efficient inference.

problem Matrix completion with underlying low-rank structure.
method Spectral scaled Student prior and PAC-Bayesian bounds.
result Minimax-optimal oracle inequality for model misspecification and general sampling distribution.

Study improves fractional posterior for 1-bit matrix completion.

problem Estimating a binary matrix from observed entries.
method Fractional posterior approach with low-rank factorization and spectral scaled Student priors.
result Concentration results for fractional posterior, demonstrating effectiveness in matrix recovery.

A new method identifies a stable subnetwork in overparameterized student models.

problem Identifying a stable subnetwork in overparameterized student models.
method Spectral representation of linear transfer of information, focusing on eigenvalues and eigenvectors.
result A stable student substructure is isolated that mirrors the true complexity of the teacher.

New method improves generative modeling on convex domains using regularized mirror maps and Student-t priors.

problem Challenges in generative modeling on convex domains with heavy-tailed targets.
method Mirror Flow Matching with regularized mirror maps and Student-t priors.
result Empirically outperforms baselines and achieves competitive sample quality.

We propose a generalized double Pareto prior for Bayesian shrinkage estimation and inferences in linear models. The prior can be obtained via a scale mixture of Laplace or normal distributions, forming a bridge between the Laplace and Normal-Jeffreys' priors. While it has a spike at zero like the Laplace density, it al…

2011-04-05abs ↗pdf ↗

Bayesian neural networks approximate Student-t processes in the infinite-width limit.

problem Modeling uncertainty in neural networks with greater flexibility.
method Extending asymptotic properties of Gaussian processes to Student-t processes in the infinite-width limit of BNNs.
result Posterior BNNs converge to Student-t processes in the infinite-width limit.

A VB method for high-dimensional regression with student-t priors achieves nearly optimal performance and computational efficiency.

problem High-dimensional linear model inferences with heavy-tailed shrinkage priors.
method Variational Bayesian (VB) procedure for high-dimensional linear models with student-t priors.
result The VB method achieves nearly optimal contraction rate and computational efficiency, outperforming MCMC methods.

We investigate the Student-t process as an alternative to the Gaussian process as a nonparametric prior over functions. We derive closed form expressions for the marginal likelihood and predictive distribution of a Student-t process, by integrating away an inverse Wishart process prior over the covariance kernel of a G…

2014-02-18abs ↗pdf ↗

Study shows human advisors use context to improve student outcomes in algorithm-assisted advising.

problem How human advisors use context to guide interventions in algorithm-assisted advising.
method Mixed-methods approach combining quantitative and qualitative data from a randomized controlled trial.
result 2 out of 3 interventions by advisors were plausibly 'expertly targeted' to students using non-algorithmic context.

Tailoring the presentation of information to the needs of individual students leads to massive gains in student outcomes~\cite{bloom19842}. This finding is likely due to the fact that different students learn differently, perhaps as a result of variation in ability, interest or other factors~\cite{schiefele1992interest…

2018-09-24abs ↗pdf ↗

Study on neural network dynamics in high dimensions with quadratic activation.

problem Understanding training dynamics in overparameterized neural networks.
method Derivation of gradient flow equations and analysis under l2-regularization.
result Characterization of estimator performance and spectral properties in the high-dimensional limit.

Improved machine learning models outperform their simpler counterparts by using imperfect labels.

problem Improving model performance using imperfect labels.
method Random feature ridge regression (RFRR) with a deterministic equivalent for excess test error.
result The student model can outperform the teacher model regardless of the teacher's scaling law, achieving the minimax optimal rate.

Student performance prediction - where a machine forecasts the future performance of students as they interact with online coursework - is a challenging problem. Reliable early-stage predictions of a student's future performance could be critical to facilitate timely educational interventions during a course. However, …

2018-04-19abs ↗pdf ↗

A new training method improves MLIPs for faster, lighter simulations.

problem High computational and memory costs of complex MLIPs for large-scale MD simulations.
method Teacher-student training framework using latent atomic energy knowledge.
result Lightweight student MLIPs achieve faster MD speeds and comparable accuracy to teachers.

Unified framework for generating meteorological time series from text.

problem Lack of large-scale, physically grounded multimodal datasets and architectures ignoring spectral-temporal structure.
method Introduce MeteoCap-3B dataset and MTransformer model.
result State-of-the-art generation quality, accurate cross-modal alignment, strong semantic controllability.

Proposes a new Bayesian mixture of student-t processes for modeling non-stationary data.

problem Non-stationary data with non-Gaussian errors.
method Bayesian mixture of student-t processes with an overall-local scale structure, using SMC for online inference.
result Superior performance compared to Gaussian processes on real-world data.

C-t3t^3VAE improves class representation in long-tailed generative models.

problem Latent geometric bias in VAEs under class imbalance.
method Per-class Student's t-distribution priors, closed-form objective, equal-weight latent mixture.
result Consistently lower FID scores and better class-balanced generation for severely imbalanced datasets.

The study uses Hidden Markov Models to analyze student enrollment patterns and academic performance.

problem Limited understanding of how enrollment patterns affect academic performance.
method Applied Hidden Markov Models to categorize enrollment strategies and compare academic outcomes.
result Mixed enrollment strategies lead to better academic performance, especially during part-time semesters.

An important, yet largely unstudied, problem in student data analysis is to detect misconceptions from students' responses to open-response questions. Misconception detection enables instructors to deliver more targeted feedback on the misconceptions exhibited by many students in their class, thus improving the quality…

2017-03-24abs ↗pdf ↗

We analyze the Hessian spectra of large models up to 100B parameters.

problem Accurate Hessian spectra of large foundation models are difficult to obtain.
method We use shard-local finite-difference Hessian vector products and stochastic Lanczos quadrature.
result We produce the first large-scale spectral density estimates of foundation models.

Compared to machines, humans are extremely good at classifying images into categories, especially when they possess prior knowledge of the categories at hand. If this prior information is not available, supervision in the form of teaching images is required. To learn categories more quickly, people should see important…

2015-04-28abs ↗pdf ↗

Paper develops methods for estimating and simulating a Student-t Lévy regression model.

problem Estimation and simulation of Student-t Lévy process with arbitrary degrees of freedom.
method Develops a two-step estimation procedure and simulates increments using inverse Fourier transform.
result Efficient estimation and simulation methods for Student-t Lévy process.

An important form of prior information in clustering comes in form of cannot-link and must-link constraints. We present a generalization of the popular spectral clustering technique which integrates such constraints. Motivated by the recently proposed 11-spectral clustering for the unconstrained problem, our method is…

2015-05-24abs ↗pdf ↗

Additive Bayesian networks are types of graphical models that extend the usual Bayesian generalized linear model to multiple dependent variables through the factorisation of the joint probability distribution of the underlying variables. When fitting an ABN model, the choice of the prior of the parameters is of crucial…

2018-09-18abs ↗pdf ↗

Bayesian model identifies skill difficulties and student subgroups in engineering education.

problem Identifying and supporting diverse student needs in entry-level university engineering modules.
method Hierarchical Bayesian modeling of student response data.
result Clear patterns of skill mastery and distinct student subgroups identified.

Gaussian process priors are commonly used in aerospace design for performing Bayesian optimization. Nonetheless, Gaussian processes suffer two significant drawbacks: outliers are a priori assumed unlikely, and the posterior variance conditioned on observed data depends only on the locations of those data, not the assoc…

2018-01-18abs ↗pdf ↗

Spectral dimensionality reduction methods enable linear separations of complex data with high-dimensional features in a reduced space. However, these methods do not always give the desired results due to irregularities or uncertainties of the data. Thus, we consider aggressively modifying the scales of the features to …

2018-05-18abs ↗pdf ↗

MCMC complexity matches optimization for large nn and dd.

problem Lack of theoretical understanding of MCMC complexity for large nn and dd.
method Comparison of MCMC, LA, and VI complexities for linear, logistic, and Poisson regression.
result MCMC complexity matches optimization complexity for ndn\gtrsim d.

In this paper we do the first large scale analysis of writing style development among Danish high school students. More than 10K students with more than 100K essays are analyzed. Writing style itself is often studied in the natural language processing community, but usually with the goal of verifying authorship, assess…

2019-06-04abs ↗pdf ↗

Improved VAE for heavy-tailed data using Student's t-distributions.

problem Over-regularization in VAEs with Gaussian priors.
method Proposed t3t^3VAE framework with Student's t-distributions for prior, encoder, and decoder.
result Significantly outperforms other models on heavy-tailed datasets.

Large scale machine learning (ML) systems such as the Alexa automatic speech recognition (ASR) system continue to improve with increasing amounts of manually transcribed training data. Instead of scaling manual transcription to impractical levels, we utilize semi-supervised learning (SSL) to learn acoustic models (AM) …

2019-04-24abs ↗pdf ↗

Enhances model compression with multi-teacher knowledge distillation.

problem Uncertainty evaluation and diverse teacher expertise in model deployment.
method Bayesian inference and teacher-informed prior with entropy-based weighting.
result Improved predictive accuracy and robust uncertainty quantification.

New diffusion models capture heavy-tailed distributions better.

problem Diffusion models struggle with rare or extreme events in heavy-tailed distributions.
method Repurposed diffusion framework using multivariate Student-t distributions, tailored perturbation kernel, and γγ-divergence.
result Our models generate rare and extreme events more effectively than standard diffusion models.

Analyzes Hessian spectrum for neural networks near optimal learning.

problem Understanding learning dynamics near optimal points in neural networks.
method Characterizes Hessian eigenspectrum for teacher-student problems, using analytical and numerical methods.
result The rank of the Hessian matrix determines effective number of parameters for non-linear networks.