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.

169,181 papers · 148 categories

Trend · papers per month

23456890 · Jun 202019922001200920182026
48 results for box office

This paper analyzes sound event detection in synthetic office audio, comparing different systems.

problem Comparing sound event detection systems in synthetic office audio.
method Analysis of systems submitted to DCASE 2016 task, using synthetic office sounds.
result Statistical analysis of results, highlighting system performance under controlled conditions.

The study uses machine learning to analyze office floor plans and predict function based on geometry.

problem Lack of formalisms to describe spatial affordance in automated floor-plan generation tools.
method Supervised and unsupervised data mining techniques, including J48 algorithm, were used to analyze office floor plans.
result J48 algorithm can predict class performance on unseen examples up to 79.5% for office dataset.

Mathematical framework for transfer learning feasibility and transfer risk.

problem Theoretical analysis of transfer learning.
method Reformulated transfer learning as an optimization problem, introduced transfer risk concept.
result Demonstrated the potential and benefits of incorporating transfer risk in transfer learning evaluation.

Spacematch matches office workers with suitable workspaces based on their preferences.

problem Matching workers with suitable workspaces in ABW environments.
method Developed a web-based mobile app to collect occupant preferences and IoT sensors for real-time environmental feedback.
result Occupant preferences can be segmented and matched to build a recommendation platform.

Study finds strict collection policies improve portfolio quality of microfinance banks.

problem Improving portfolio quality of microfinance banks through better credit collection policies.
method Multi-stage sampling, regression analysis, descriptive statistics.
result Collection policy has a higher effect on portfolio quality.

Study models parking duration using machine learning and interpretable methods.

problem Parking issues in developing countries like India.
method Artificial neural networks (ANNs) for capturing relationships; Garson algorithm and LIME for model interpretation.
result LIME shows higher prediction accuracy and can be universally adopted.

Runaway feedback loops in predictive policing cause crime rate disparities.

problem Runaway feedback loops in predictive policing systems exacerbate crime rate disparities.
method Developed a mathematical model to explain and demonstrate interventions to prevent runaway feedback loops.
result Interventions can prevent runaway feedback loops and allow true crime rates to be learned.

The paper tackles MSDA by learning dictionary atoms in Wasserstein space.

problem Mitigating data distribution shifts across multiple source domains to target domain.
method Dictionary learning and optimal transport in Wasserstein space; DaDiL algorithm for learning.
result Improved classification performance by 3.15%, 2.29%, and 7.71% in benchmarks.

Selective pseudo-labeling improves unsupervised domain adaptation.

problem Classifying unlabeled target domain samples with labeled source domain samples.
method Structured prediction for selective pseudo-labeling.
result Selective pseudo-labeling outperforms state-of-the-art methods.

AutoTune learns wireless identifiers for facial recognition in real-world settings.

problem Facial recognition requires extensive user training, making it impractical for widespread deployment.
method Uses ambient wireless identifiers to train deep neural networks for facial recognition without user effort.
result Demonstrates a system that continuously refines facial recognition using wireless identifiers over time.

Study shows visual feedback and monetary incentives reduce plugload energy consumption in commercial buildings.

problem Mitigating energy consumption in commercial buildings through occupant plugload control.
method Field experiments with visual feedback and monetary incentives in government and university buildings.
result Mean energy reduction of ~9.52% in office environments and ~21.61% in university environments with visual feedback.

CDSPP learns domain-specific projections for heterogeneous domain adaptation.

problem Heterogeneous domain adaptation problems where source and target domains have different modalities or feature dimensions.
method Cross-Domain Structure Preserving Projection (CDSPP) algorithm that learns domain-specific projections to map features into a common subspace.
result CDSPP achieves superior performance in both supervised and semi-supervised HDA compared to state-of-the-art methods.

ODS improves adversarial attacks by maximizing output diversity.

problem Efficiency and effectiveness of adversarial attacks, especially black-box attacks.
method Output Diversified Sampling (ODS) that maximizes diversity in model outputs.
result ODS reduces the number of queries needed for black-box attacks on ImageNet by a factor of two.

New research shows many recent defenses against adversarial examples are ineffective against black-box attacks.

problem The robustness of recent defenses against adversarial examples is insufficient, especially against black-box attacks.
method Evaluation of nine defenses on two black-box adversarial models and six attacks on CIFAR-10 and Fashion-MNIST datasets.
result Most recent defenses provide only marginal improvements in security (<25%<25\%) compared to undefended networks.

Methodology measures financial impacts using existing credit loss infrastructure.

problem Measuring the impact of financial scenarios on expected credit losses.
method Captures scenario effects through changes in default probabilities; uses existing provisioning infrastructure.
result Methodology validated through standardized climate scenario exercise in Canada and Quebec.

Avoid explaining black box models; use interpretable ones instead.

problem High-stakes decisions made by black box models cause societal harm.
method Design inherently interpretable models instead of trying to explain black box models.
result Inherently interpretable models are a better approach for high-stakes decisions.

Extracts weighted automata from black box models for sequential data.

problem Global interpretability of black box models for symbolic sequential data.
method Spectral algorithm for extracting weighted automata from black boxes without access to inner representation.
result Approximation of black box models using inferred weighted automata is of high quality.

Enhanced Elastic-Net with box-constraint improves support recovery in noisy measurements.

problem Support recovery of sparse signals from noisy measurements.
method Box-Elastic Net (Box-EN) method with mean squared error and probability of support recovery analysis.
result The Box-Elastic Net outperforms the standard Elastic-Net in support recovery.

Researchers organize and analyze a large public safety imagery dataset.

problem Efficiently organizing and analyzing a vast public safety imagery dataset.
method Hierarchical organization approach using Lincoln Laboratory Supercomputing Cluster for compute and storage.
result Successfully organized and evaluated the dataset with large-scale imagery inference across terabytes of data.

Spanning attack improves black-box attacks with unlabeled data.

problem Query inefficiency in black-box attacks due to high input space dimensionality.
method Proposes spanning attack by constraining adversarial perturbations in a low-dimensional subspace via an auxiliary unlabeled dataset.
result Significantly improves query efficiency of black-box attacks.

Distill-and-Compare audits black-box models by training transparent models to mimic them.

problem Auditing proprietary, opaque black-box risk scoring models.
method Model distillation and comparison of transparent student models to black-box models.
result Identifies missing features in black-box models, improving transparency.

A new method trains deep neural networks for open set domain adaptation without negative open set difference.

problem Training deep neural networks for open set domain adaptation without negative open set difference.
method Proposes a new upper bound of target-domain risk, including source-domain risk, ε-open set difference (ΔεΔ_ε), distributional discrepancy, and constant. Uses gradient descent for source-domain risk and ΔεΔ_ε, and adversarial training for distributional discrepancy. Trains DNNs via minimizing the new upper bound.
result Shows state-of-the-art performance on benchmark datasets.