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

5111621 · May 202019922001200920172026
48 results for full-time vs part-time

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.

Bayesian Causal Forests model assesses part-time work's impact on student growth.

problem Estimating causal effects of part-time work on student growth in mathematics achievement.
method Longitudinal Bayesian Causal Forests model combining non-parametric and difference-in-differences methods.
result Negative impact of part-time work for most students, potential benefits for those with low school belonging, widening achievement gap identified.

Automatic summarization of natural language is a current topic in computer science research and industry, studied for decades because of its usefulness across multiple domains. For example, summarization is necessary to create reviews such as this one. Research and applications have achieved some success in extractive …

2018-12-18abs ↗pdf ↗

Proposes SOVR loss to improve adversarial robustness by increasing logit margins.

problem Adversarial training's difficulty in robustness against sophisticated attacks.
method Introduces SOVR loss function that switches from cross-entropy to one-vs-the-rest loss for important samples.
result SOVR loss increases logit margins of important samples, improving robustness against Auto-Attack.

We present Vector-Space Markov Random Fields (VS-MRFs), a novel class of undirected graphical models where each variable can belong to an arbitrary vector space. VS-MRFs generalize a recent line of work on scalar-valued, uni-parameter exponential family and mixed graphical models, thereby greatly broadening the class o…

2015-05-19abs ↗pdf ↗

Training of one-vs.-rest SVMs can be parallelized over the number of classes in a straight forward way. Given enough computational resources, one-vs.-rest SVMs can thus be trained on data involving a large number of classes. The same cannot be stated, however, for the so-called all-in-one SVMs, which require solving a …

2016-11-25abs ↗pdf ↗

Preschool attendance correlates with lower developmental vulnerabilities in Queensland, Australia.

problem Understanding the relationship between preschool attendance and developmental vulnerabilities in different regions.
method Data Analysis and Machine Learning to identify clusters of socio-demographic variables.
result Identified three clusters with varying socio-demographic variables affecting the relationship between preschool attendance and developmental vulnerabilities.

TRS-ODENs learn dynamics with time-reversal symmetry for more efficient learning.

problem Learning dynamics with time-reversal symmetry for more efficient learning.
method Proposed a loss function and a new framework (TRS-ODENs) to learn dynamics efficiently.
result TRS-ODENs can learn dynamics from noisy and complex trajectories efficiently.

Many supervised learning tasks are emerged in dual forms, e.g., English-to-French translation vs. French-to-English translation, speech recognition vs. text to speech, and image classification vs. image generation. Two dual tasks have intrinsic connections with each other due to the probabilistic correlation between th…

2017-07-03abs ↗pdf ↗

The paper revisits discriminative vs. generative classifiers, showing naive Bayes requires fewer samples.

problem Comparing discriminative and generative classifiers in multiclass settings.
method Theoretical analysis and simulations of naive Bayes vs. logistic regression.
result Multiclass naive Bayes requires fewer samples to approach asymptotic error compared to logistic regression.

The study examines flat S1-bundles and their homology groups, focusing on analytic vs smooth conditions.

problem Analyzing the vanishing of the rational Euler class in real analytic flat S1-bundles.
method Using Thurston's theorem and Haefliger's classifying space, the study investigates the homology groups of Diff+δ⁺S1.
result If the rational Euler class vanishes for real analytic flat S1-bundles, it implies the presence of specific torsion classes in Diffω,δ⁺S1.

New online conformal prediction methods minimize strongly adaptive regret and achieve near-optimal coverage.

problem Uncertainty quantification in online settings with changing data distributions.
method Developed new online conformal prediction methods that minimize strongly adaptive regret.
result Achieve near-optimal strongly adaptive regret and approximately valid coverage.

Improves uncertainty estimation and OOD detection in neural networks.

problem Accurate uncertainty estimation and OOD detection in neural networks.
method Investigates one-vs-all and distance-based logit representations for probabilities.
result One-vs-all formulations improve calibration without additional complexity.

Deep learning classifies autism vs controls with high accuracy using large fMRI dataset.

problem Classification difficulty of autism vs typically developing controls with fMRI data.
method Ensemble CNN model trained on 43,858 fMRI datapoints, employing class-balancing and visualization methods.
result Deep learning models achieve AUROCs of 0.6774, 0.7680, and 0.9222 for ASD vs TD, gender, and task vs rest classifications.

A common method of generalizing binary to multi-class classification is the error correcting code (ECC). ECCs may be optimized in a number of ways, for instance by making them orthogonal. Here we test two types of orthogonal ECCs on seven different datasets using three types of binary classifier and compare them with t…

2018-01-27abs ↗pdf ↗

Donor-aware scRNA-seq benchmarks improve classification accuracy in inflammatory bowel disease.

problem Influenza disease classification from scRNA-seq data is prone to donor-level confounding.
method Developed and evaluated three feature representations across two IBD cohorts.
result Compartment-stratified CLR composition and GatedStructuralCFN embeddings outperform linear models in classification accuracy.

Analyzes the generalization and training errors of the random feature model over time.

problem Understanding the temporal behavior of generalization and training errors in deep learning.
method Uses Cauchy complex integral representations and random matrix methods based on linear pencils.
result Analytical solution of the full time-evolution path of generalization and training errors.

CoroNet detects COVID-19 from chest X-rays with high accuracy.

problem Detecting COVID-19 from chest X-rays using limited testing kits.
method Proposes CoroNet, a deep neural network based on Xception architecture trained on a combined dataset of COVID-19 and pneumonia X-rays.
result CoroNet achieved an overall accuracy of 89.6% and precision/recall rates of 93%/98.2% for 4-class cases (COVID vs Pneumonia bacterial vs pneumonia viral vs normal).

The complex world around us is inherently multimodal and sequential (continuous). Information is scattered across different modalities and requires multiple continuous sensors to be captured. As machine learning leaps towards better generalization to real world, multimodal sequential learning becomes a fundamental rese…

2019-11-22abs ↗pdf ↗

Surrogate models help predict complex systems with less computational cost.

problem Uncertainty in complex systems due to variability and external loads.
method Surrogate models trained on limited simulations to approximate full time-dependent response.
result Efficient surrogate models reduce computational expense for UQ in nonlinear dynamics.

This paper analyzes data-driven Newsvendor problems and finds a wide range of possible regrets.

problem Guessing the number drawn from an unknown distribution with asymmetric costs.
method Unified analysis using the notion of clustered distributions and new lower bounds.
result The entire spectrum of achievable regrets from 1/n1/\sqrt{n} to 1/n1/n is possible.

We study submetries between Alexandrov spaces and show how some of the usual features of Riemannian submersions fail due to the lack of smoothness.

2009-09-25abs ↗pdf ↗

Graph representation learning resurges as a trending research subject owing to the widespread use of deep learning for Euclidean data, which inspire various creative designs of neural networks in the non-Euclidean domain, particularly graphs. With the success of these graph neural networks (GNN) in the static setting, …

2019-02-26abs ↗pdf ↗

Paper tackles P vs NP problem in portfolio optimization with cardinality constraints and Black-Scholes derivatives.

problem Operationalizing the P vs NP problem in cardinality-constrained portfolio selection.
method Mixed-integer quadratic program with genetic algorithms, Monte Carlo sampling, and greedy screening.
result Cardinality constraint reshapes efficient frontier, highlighting trade-offs between stability and computational cost.

CLARITY compares dissimilar datasets, identifying structural and relationship inconsistencies.

problem Integrating qualitatively different datasets from various disciplines.
method Non-parametric approach decomposing similarities into structural and relationship components.
result Identifies and interprets inconsistencies between datasets.

This contribution discusses in what respect Econophysics may be able to contribute to the rebuilding of economics theory. It focuses on aggregation, individual vs collective learning and functional wisdom of the crowds.

2016-05-02abs ↗pdf ↗